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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050066 a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for n >= 4. 4
1, 3, 3, 4, 7, 8, 11, 14, 18, 19, 22, 25, 29, 36, 44, 55, 69, 70, 73, 76, 80, 87, 95, 106, 120, 138, 157, 179, 204, 233, 269, 313, 368, 369, 372, 375, 379, 386, 394, 405, 419, 437, 456, 478, 503, 532, 568, 612 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 3}, Flatten@Table[k, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 08 2015 *)

CROSSREFS

Cf. similar sequences with different initial conditions listed in A050034.

Sequence in context: A058674 A152651 A091973 * A050064 A137894 A087329

Adjacent sequences:  A050063 A050064 A050065 * A050067 A050068 A050069

KEYWORD

nonn

AUTHOR

Clark Kimberling

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 08:50 EDT 2019. Contains 322306 sequences. (Running on oeis4.)