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!)
A049951 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = 1, a(2) = 2, and a(3) = 1. 0
1, 2, 1, 6, 16, 28, 60, 142, 398, 656, 1316, 2654, 5422, 11358, 24714, 58132, 163038, 267946, 535896, 1071814, 2143742, 4287998, 8577994, 17164692, 34376158, 68962130, 138728128, 280672440, 574221574, 1200240586, 2612191482 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..31.

MAPLE

s := proc(n) option remember; `if`(n < 1, 0, a(n) + s(n - 1)); end proc;

a := proc(n) option remember; `if`(n < 4, [1, 2, 1][n], s(n - 1) + a(-2^ceil(log[2](n - 1)) + 2*n - 2)); end proc;

seq(a(n), n = 1 .. 40); # Petros Hadjicostas, Apr 23 2020

CROSSREFS

Sequence in context: A210654 A068797 A254639 * A025263 A097947 A101032

Adjacent sequences:  A049948 A049949 A049950 * A049952 A049953 A049954

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by Petros Hadjicostas, Apr 23 2020

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 October 5 21:20 EDT 2022. Contains 357261 sequences. (Running on oeis4.)