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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050063 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, 3, 2, 5, 10, 13, 18, 31, 62, 65, 70, 83, 114, 179, 262, 441, 882, 885, 890, 903, 934, 999, 1082, 1261, 1702, 2587, 3490, 4489, 5750, 8337, 12826, 21163, 42326, 42329, 42334, 42347, 42378, 42443, 42526, 42705, 43146, 44031 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 2}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 07 2015 *)
CROSSREFS
Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050067, A050071 (similar, but with different initial conditions).
Sequence in context: A049920 A257981 A128914 * A274761 A100885 A209199
KEYWORD
nonn
AUTHOR
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 May 6 12:40 EDT 2024. Contains 372293 sequences. (Running on oeis4.)