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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050058 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, 1, 2, 5, 6, 9, 10, 12, 13, 16, 17, 19, 24, 30, 39, 49, 50, 53, 54, 56, 61, 67, 76, 86, 98, 111, 127, 144, 163, 187, 217, 256, 257, 260, 261, 263, 268, 274, 283, 293, 305, 318, 334, 351, 370, 394, 424 (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, 1}, 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: A183386 A231818 A084614 * A144204 A048226 A049919

Adjacent sequences:  A050055 A050056 A050057 * A050059 A050060 A050061

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 14:43 EST 2016. Contains 278781 sequences.