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!)
A049921 a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2. 2
1, 3, 2, 3, 8, 14, 29, 57, 116, 176, 380, 775, 1556, 3117, 6235, 12469, 24940, 37412, 81058, 165234, 332029, 664839, 1330073, 2660350, 5320760, 10641579, 21283186, 42566387, 85132780, 170265565, 340531131, 681062261, 1362124524 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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, 3, 2][n], s(n - 1) - a(2^ceil(log[2](n - 1)) + 2 - n)):

end proc:

seq(a(n), n = 1..34); # Petros Hadjicostas, Nov 14 2019

CROSSREFS

Sequence in context: A288247 A143744 A095243 * A191628 A261999 A216829

Adjacent sequences:  A049918 A049919 A049920 * A049922 A049923 A049924

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by Petros Hadjicostas, Nov 14 2019

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 22 11:02 EDT 2022. Contains 353949 sequences. (Running on oeis4.)