|
Search: id:A080605
|
|
|
| A080605 |
|
Golomb's sequence using odd integers. |
|
+0
5
|
|
| 1, 3, 3, 3, 5, 5, 5, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25, 25, 25, 25
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) is asymptotic to tau^(2-tau)*(2n)^(tau-1) and more precisely it seems that a(n)=round(tau^(2-tau)*(2n)^(tau-1)) +(-1, +0 or +1) where tau is the golden ratio.
|
|
EXAMPLE
|
Read 1,3,3,3,5,5,5,7,7,7,9,9,9,9,9,11,11,11,11,11, as 1,(3,3,3),(5,5,5),(7,7,7),(9,9,9,9,9),(11,11,11,11,11), count occurrences between 2 parentheses, gives 1,3,3,3,5,5,... which is the sequence itself.
|
|
CROSSREFS
|
Cf. A001462 A080606, A080607.
Sequence in context: A001650 A130175 A101290 this_sequence A130823 A101435 A077886
Adjacent sequences: A080602 A080603 A080604 this_sequence A080606 A080607 A080608
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 25 2003
|
|
|
Search completed in 0.002 seconds
|
