Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Golomb_sequence> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Golomb_sequence abstract "In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman's sequence), is a non-decreasing 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 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 are1, 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 A001462 in OEIS).a1 = 1 Therefore 1 occurs exactly one time in this sequence.a2 > 1 a2 = 22 occurs exactly 2 times in this sequence. a3 = 2 3 occurs exactly 2 times in this sequence.a4 = a5 = 34 occurs exactly 3 times in this sequence. 5 occurs exactly 3 times in this sequence.a6 = a7 = a8 = 4 a9 = a10 = a11 = 5etc.Colin Mallows has given an explicit recurrence relation . An asymptotic expression for an is where φ is the golden ratio.".
- Golomb_sequence wikiPageID "8549940".
- Golomb_sequence wikiPageRevisionID "556281386".
- Golomb_sequence hasPhotoCollection Golomb_sequence.
- Golomb_sequence subject Category:Golden_ratio.
- Golomb_sequence subject Category:Integer_sequences.
- Golomb_sequence type Abstraction100002137.
- Golomb_sequence type Arrangement107938773.
- Golomb_sequence type Group100031264.
- Golomb_sequence type IntegerSequences.
- Golomb_sequence type Ordering108456993.
- Golomb_sequence type Sequence108459252.
- Golomb_sequence type Series108457976.
- Golomb_sequence comment "In mathematics, the Golomb sequence, named after Solomon W. Golomb (but also called Silverman's sequence), is a non-decreasing 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 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.".
- Golomb_sequence label "Golomb sequence".
- Golomb_sequence label "Golomb-Folge".
- Golomb_sequence label "Rij van Golomb".
- Golomb_sequence label "Sequência de Golomb".
- Golomb_sequence label "Suite de Golomb".
- Golomb_sequence sameAs Golomb-Folge.
- Golomb_sequence sameAs Suite_de_Golomb.
- Golomb_sequence sameAs Rij_van_Golomb.
- Golomb_sequence sameAs Sequência_de_Golomb.
- Golomb_sequence sameAs m.0277jxf.
- Golomb_sequence sameAs Q498247.
- Golomb_sequence sameAs Q498247.
- Golomb_sequence sameAs Golomb_sequence.
- Golomb_sequence wasDerivedFrom Golomb_sequence?oldid=556281386.
- Golomb_sequence isPrimaryTopicOf Golomb_sequence.