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

 

Logo

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 60, we have over 367,000 sequences, and we’ve crossed 11,000 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
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
FORMULA
a(n) = tau^(2-tau)*(2n)^(tau-1)+O(n^(tau-1)/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*n-1))); a
CROSSREFS
Sequence in context: A130175 A200266 A101290 * A130823 A101435 A077886
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 25 2003
EXTENSIONS
Corrected at the suggestion of Kevin Ryde by Benoit Cloitre, May 31 2012
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 04:17 EST 2023. Contains 367506 sequences. (Running on oeis4.)