|
|
A266535
|
|
Sums of two successive terms of A256249, with a(0) = 0.
|
|
4
|
|
|
0, 1, 3, 7, 11, 15, 23, 35, 43, 47, 55, 67, 83, 103, 127, 155, 171, 175, 183, 195, 211, 231, 255, 283, 315, 351, 391, 435, 483, 535, 591, 651, 683, 687, 695, 707, 723, 743, 767, 795, 827, 863, 903, 947, 995, 1047, 1103, 1163, 1227, 1295, 1367, 1443, 1523, 1607, 1695, 1787, 1883, 1983, 2087, 2195, 2307, 2423, 2543, 2667, 2731
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
It appears that this sequence has a fractal-like behavior (see Plot 2, A139250 vs. this sequence).
First differs from both the toothpick sequence A139250 and A256265 at a(12), with which it shares infinitely many terms.
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) f(n)=n++; b=#binary(n>>1); (4^b-1)/3+(n-2^b)^2; \\ A256249
a(n) = if (n, f(n)+f(n-1), 0);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|