login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080606 Golomb's sequence using even integers. 7
2, 2, 4, 4, 6, 6, 6, 6, 8, 8, 8, 8, 10, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, 18, 18, 18, 18, 20, 20, 20, 20, 20, 20, 20, 20, 22, 22, 22, 22, 22, 22, 22, 22, 24, 24, 24, 24, 24, 24, 24, 24, 26, 26, 26, 26, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

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 2,2,4,4,6,6,6,6,8,8,8,8,10,10,10,10,10,10 as (2,2),(4,4),(6,6,6,6),(8,8,8,8),(10,10,10,10,10,10) count occurrences between 2 parentheses, gives 2,2,4,4,6,... which is the sequence itself.

MATHEMATICA

a = {2, 2}; Do[a = Join[a, Array[2i&, a[[i]]]], {i, 2, 13}]; a (* Ivan Neretin, Apr 03 2015 *)

CROSSREFS

Cf. A001462, A080605, A080607.

Sequence in context: A257686 A057144 A198332 * A083535 A250983 A070320

Adjacent sequences:  A080603 A080604 A080605 * A080607 A080608 A080609

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Feb 25 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 29 15:03 EDT 2017. Contains 287247 sequences.