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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050031 a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4. 11
1, 1, 2, 3, 6, 7, 10, 17, 34, 35, 38, 45, 62, 97, 142, 239, 478, 479, 482, 489, 506, 541, 586, 683, 922, 1401, 1890, 2431, 3114, 4515, 6946, 11461, 22922, 22923, 22926, 22933, 22950, 22985, 23030, 23127, 23366, 23845, 24334 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

MATHEMATICA

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

CROSSREFS

Cf. A050027, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050063, A050067, A050071 (similar, but with different initial conditions).

Sequence in context: A058632 A086583 A107852 * A003421 A253239 A226384

Adjacent sequences:  A050028 A050029 A050030 * A050032 A050033 A050034

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 May 25 15:44 EDT 2019. Contains 323572 sequences. (Running on oeis4.)