login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A049930
a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p 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(4) = 4.
0
1, 3, 4, 7, 12, 26, 50, 99, 195, 396, 790, 1579, 3155, 6305, 12596, 25168, 50287, 100672, 201342, 402683, 805363, 1610721, 3221428, 6442832, 12885615, 25771134, 51542067, 103083740, 206166691, 412331806, 824660462, 1649314633
OFFSET
1,2
PROG
(PARI) lista(nn) = { my(va = vector(nn)); va[1] = 1; va[2] = 3; va[3] = 4; my(sa = vecsum(va)); for (n=4, nn, va[n] = sa - va[n - 1 - 2^ceil(-1 + log(n-1)/log(2))]; sa += va[n]; ); va; } \\ Petros Hadjicostas, Apr 26 2020
CROSSREFS
Sequence in context: A124636 A231337 A373805 * A102938 A076784 A279815
KEYWORD
nonn
EXTENSIONS
Name edited by Petros Hadjicostas, Apr 26 2020
STATUS
approved