The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A049896 a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4. 1
1, 1, 4, 5, 7, 17, 31, 59, 94, 218, 433, 863, 1702, 3341, 6343, 11417, 18193, 42728, 85453, 170903, 341782, 683501, 1366663, 2732057, 5459473, 10907096, 21746932, 43237535, 85450189, 166807568, 317327677, 570952097, 910026706 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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, 1, 4][n],
s(n - 1) - a(-2^ceil(log[2](n - 1)) + 2*n - 3))
end proc:
seq(a(n), n = 1..40); # Petros Hadjicostas, Nov 15 2019
MATHEMATICA
Nest[Append[#1, Total@ #1 - #1[[-2^Ceiling[#3] + 2 #2 - 3]] ] & @@ {#1, #2, Log2[#2 - 1]} & @@ {#, Length@ # + 1} &, {1, 1, 4}, 30] (* Michael De Vlieger, Nov 15 2019 *)
CROSSREFS
Sequence in context: A107289 A056659 A292321 * A029520 A123368 A292164
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name edited by Petros Hadjicostas, Nov 15 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 June 5 04:27 EDT 2024. Contains 373102 sequences. (Running on oeis4.)