OFFSET
0,3
COMMENTS
For any k >= 0, A000700(k) equals the number of occurrences of k in the sequence. - Rémy Sigrist, Jan 19 2019
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..8192
FORMULA
a(2^n-1) = n^2.
a(n) mod 2 = A010060(n).
G.f.: (1/(1 - x))*Sum_{k>=0} (2*k + 1)*x^(2^k)/(1 + x^(2^k)). - Ilya Gutkovskiy, Jul 23 2017
PROG
(PARI) a(n) = my (b=Vecrev(binary(n))); sum(i=1, #b, if (b[i], 2*i-1, 0)) \\ Rémy Sigrist, Jan 19 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Philippe Deléham, Oct 14 2011
STATUS
approved