| 0, 1, 4, 6, 12, 19, 24, 28, 40, 53, 68, 82, 92, 103, 112, 120, 144, 169, 196, 222, 252, 283, 312, 340, 360, 381, 404, 426, 444, 463, 480, 496, 544, 593, 644, 694, 748, 803, 856, 908, 968, 1029, 1092, 1154, 1212, 1271, 1328, 1384, 1424, 1465, 1508, 1550
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(n) = sum(XORnos(j, floor(j/2)), j=0..n)
a(n) = b(n-1), with b(2n)=2(b(n)+b(n-1)+ceil(n/2)), b(2n+1)=4b(n)+n+1. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 13 2003
|
|
CROSSREFS
|
a(2^n-1) = A000217[ 2^n-1 ] for all n.
Sequence in context: A073123 A079865 A027856 this_sequence A023599 A087881 A063607
Adjacent sequences: A048638 A048639 A048640 this_sequence A048642 A048643 A048644
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Antti Karttunen, Jul 14 1999
|
|
