

A080605


Golomb's sequence using odd integers.


6



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, 25, 25, 25, 25, 25, 25, 25, 25, 25, 27
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Ivan Neretin, Table of n, a(n) for n = 1..10000


FORMULA

a(n) = tau^(2tau)*(2n)^(tau1)+O(n^(tau1)/log(n)) 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.


PROG

(PARI) a=[1, 3, 3, 3]; for(n=3, 20, for(i=1, a[n], a=concat(a, 2*n1))); a


CROSSREFS

Cf. A001462, A080606, A080607.
Sequence in context: A130175 A200266 A101290 * A130823 A101435 A077886
Adjacent sequences: A080602 A080603 A080604 * A080606 A080607 A080608


KEYWORD

nonn


AUTHOR

Benoit Cloitre, Feb 25 2003


EXTENSIONS

Corrected at the suggestion of Kevin Ryde by Benoit Cloitre, May 31 2012


STATUS

approved



