|
Search: id:A080277
|
|
| |
|
| 1, 4, 5, 12, 13, 16, 17, 32, 33, 36, 37, 44, 45, 48, 49, 80, 81, 84, 85, 92, 93, 96, 97, 112, 113, 116, 117, 124, 125, 128, 129, 192, 193, 196, 197, 204, 205, 208, 209, 224, 225, 228, 229, 236, 237, 240, 241, 272, 273, 276, 277, 284, 285, 288, 289, 304, 305, 308
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Klaus Brockhaus, Illustration of A038712 and A080277
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(n) is conjectured to be asymptotic to n*log(n)/log(2). - Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 23 2003
a(n) = Sum_{k=0..log_2(n)} 2^k*floor(n/2^k).
a(2^k) = (k+1)*2^k.
a(n)=n+2*a(floor(n/2)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 06 2003
a(1)=1, a(2n) = 2a(n) + 2n, a(2n+1) = 2a(n) + 2n + 1. G.f. 1/(1-x) * sum(k>=0, 2^k*t/(1-t), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 07 2003
|
|
CROSSREFS
|
Cf. A038712, A080333.
Sequence in context: A067371 A068719 A034773 this_sequence A047608 A130011 A050022
Adjacent sequences: A080274 A080275 A080276 this_sequence A080278 A080279 A080280
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 19 2003
|
|
|
Search completed in 0.002 seconds
|
