Golden ratio | Integer sequences

Golomb sequence

In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman's sequence), is a monotonically increasing integer sequence where an is the number of times that n occurs in the sequence, starting with a1 = 1, and with the property that for n > 1 each an is the smallest unique integer which makes it possible to satisfy the condition. For example, a1 = 1 says that 1 only occurs once in the sequence, so a2 cannot be 1 too, but it can be, and therefore must be, 2. The first few values are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12 (sequence in the OEIS). (Wikipedia).

Video thumbnail

Planing Sequences (Le Rabot) - Numberphile

Featuring Neil Sloane from the OEIS - and his carpenter's plane. Mandelbrot papers offer: https://www.patreon.com/posts/52011294 More links & stuff in full description below ↓↓↓ More Neil Sloane videos: http://bit.ly/Sloane_Numberphile The OEIS: https://oeis.org Discuss this video on Br

From playlist Neil Sloane on Numberphile

Video thumbnail

Six Sequences - Numberphile

Which of these number sequences do you like best? Vote at http://bit.ly/IntegestVote The extra bit of footage is at: http://youtu.be/p-p7ozCnjfU More links & stuff in full description below ↓↓↓ This video features Tony Padilla from the University of Nottingham: https://twitter.com/DrTonyP

From playlist Tony Padilla on Numberphile

Video thumbnail

Tomas Rokicki - Large Golomb Rulers - G4G12 April 2016

Does a subquadratic Golomb Ruler exist for any number of marks? We share our exploration of this question. We have shown there are always subquadratic rulers through 492,115 marks, but the existing constructions do not find any for 492,116 marks.

From playlist G4G12 Videos

Video thumbnail

USC Living History Project - Solomon Golomb (2014)

Solomon Golomb, Distinguished Professor of Electrical Engineering and Mathematics, Viterbi School of Engineering. Interviewed by Alexander A. Sawchuk, Professor in the Ming Hsieh Dept of Electrical Engineering, Viterbi School of Engineering.

From playlist Interviews

Video thumbnail

The Pentomino Puzzle (and Tetris) - Numberphile

Featuring Alex Bellos on Polyominoes. See the accompanying coin hexagon video: https://youtu.be/_pP_C7HEy3g More links & stuff in full description below ↓↓↓ More Alex Bellos videos: http://bit.ly/Bellos_Playlist Related Bellos books on Amazon... US links Can You Solve My Problems: https:

From playlist Alex Bellos on Numberphile

Video thumbnail

Erika Berenice Roldán Roa - Polyominoes with Maximally Many Holes - G4G13 Apr 2018

In 1953 Solomon W. Golomb defined a polyomino as a rook-wise, connected subset of squares of the infinite checkerboard. The first polyomino puzzles were tiling problems. Most of the time in tiling problems one restricts to simply-connected polyominoes (i.e., polyominoes without holes). But

From playlist G4G13 Videos

Video thumbnail

GoGeometry Action 58!

Link: https://www.geogebra.org/m/SWuW45TS

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 71!

Link: https://www.geogebra.org/m/nXvKNUHa

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 32!

Link: https://www.geogebra.org/m/kSYmnker

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 136!

Link: https://www.geogebra.org/m/f7bhF78u

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 61!

Link: https://www.geogebra.org/m/EtHMAgRw

From playlist Geometry: Challenge Problems

Video thumbnail

How I Solved Sparse Rulers

In a sparse ruler, such as {0, 1, 6, 9, 11, 13}, all the distances can still be measured even though many marks are missing. The speaker has proven, by construction, that sparse rulers of any length L can be constructed with no more than round (sqrt(3 L + 9/4)) + 1 marks. In addition, on a

From playlist Wolfram Technology Conference 2021

Video thumbnail

GoGeometry Action 159!

Link: https://www.geogebra.org/m/wxywrnwh

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 123!

Link: https://www.geogebra.org/m/YZNsuM5f

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 21!

Link: https://www.geogebra.org/m/XCmSMnRe

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 31!

Link: https://www.geogebra.org/m/W6DkjUwa

From playlist Geometry: Challenge Problems

Video thumbnail

GoGeometry Action 155!

Link: https://www.geogebra.org/m/dQGGD4Pf

From playlist Geometry: Challenge Problems

Video thumbnail

Anany Levitin - Polyomino Puzzles and Algorithm Design Techniques - G4G13 April 2018

The presentation – in memoriam of Solomon Golomb – shows how polyomino puzzles can be used for illustrating different algorithm design techniques

From playlist G4G13 Videos

Related pages

Integer sequence | Golden ratio | Solomon W. Golomb | Recurrence relation