The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080605 Golomb's sequence using odd integers. 6

%I

%S 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,

%T 15,15,15,15,17,17,17,17,17,17,17,19,19,19,19,19,19,19,21,21,21,21,21,

%U 21,21,21,21,23,23,23,23,23,23,23,23,23,25,25,25,25,25,25,25,25,25,27

%N Golomb's sequence using odd integers.

%H Ivan Neretin, <a href="/A080605/b080605.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = tau^(2-tau)*(2n)^(tau-1)+O(n^(tau-1)/log(n)) where tau is the golden ratio.

%e 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.

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

%Y Cf. A001462, A080606, A080607.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Feb 25 2003

%E Corrected at the suggestion of Kevin Ryde by _Benoit Cloitre_, May 31 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 06:09 EST 2022. Contains 358454 sequences. (Running on oeis4.)