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”).

A050052
a(n) = 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) = 1, a(2) = 2, and a(3) = 4.
11
1, 2, 4, 5, 9, 10, 14, 23, 37, 38, 42, 51, 65, 102, 144, 209, 353, 354, 358, 367, 381, 418, 460, 525, 669, 1022, 1380, 1761, 2221, 2890, 4270, 6491, 10761, 10762, 10766, 10775, 10789, 10826, 10868, 10933, 11077, 11430, 11788
OFFSET
1,2
LINKS
MAPLE
a := proc(n) option remember;
`if`(n < 4, [1, 2, 4][n], a(n - 1) + a(-2^ceil(log[2](n - 1)) + 2*n - 3)):
end proc:
seq(a(n), n = 1..60); # Petros Hadjicostas, Nov 14 2019
MATHEMATICA
Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 2, 4}, Flatten@Table[2 k - 1, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 07 2015 *)
CROSSREFS
Same as A050036 and A050068 except for second term.
Cf. similar sequences with different initial conditions: A050024 (1,1,1), A050028 (1,1,2), A050032 (1,1,3), A050036 (1,1,4), A050040 (1,2,1), A050044 (1,2,2), A050048 (1,2,3), A050056 (1,3,1), A050060 (1,3,2), A050064 (1,3,3), A050068 (1,3,4).
Sequence in context: A167180 A091271 A063985 * A071349 A282737 A039891
KEYWORD
nonn
EXTENSIONS
Name edited by Petros Hadjicostas, Nov 14 2019
STATUS
approved