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!)
A049891 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), starting with a(1) = a(2) = 1 and a(3) = 2. 3
1, 1, 2, 3, 4, 10, 18, 29, 39, 106, 210, 413, 807, 1537, 2767, 4410, 5947, 16303, 32604, 65201, 130383, 260689, 521071, 1041018, 2079163, 4146433, 8243968, 16292448, 31804567, 60503719, 108861423, 173511575, 234015294, 641542162 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
PROG
(PARI) lista(nn) = { nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 2; my(sa = vecsum(va)); for (n=4, nn, va[n] = sa - va[2*(n - 1 - 2^logint(n-2, 2))]; sa += va[n]; ); va; } \\ Petros Hadjicostas, May 03 2020
CROSSREFS
Cf. A049890 (similar, but with minus a(m/2)), A049938 (similar, but with plus a(m/2)), A049939 (similar, but with plus a(m)).
Sequence in context: A098088 A080500 A007661 * A135432 A108364 A346489
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name edited by Petros Hadjicostas, May 03 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 May 14 04:33 EDT 2024. Contains 372528 sequences. (Running on oeis4.)