|
|
A049925
|
|
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 and a(2) = a(3) = 3.
|
|
0
|
|
|
1, 3, 3, 4, 10, 17, 35, 70, 142, 215, 465, 948, 1903, 3812, 7625, 15250, 30502, 45755, 99135, 202083, 406075, 813105, 1626693, 3253636, 6507345, 13014762, 26029559, 52059136, 104118279, 208236564, 416473129, 832946258, 1665892518
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
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, 3, 3][n], s(n - 1) - a(2^ceil(log[2](n - 1)) + 2 - n)):
end proc:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|