This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A188064 Partial sums of wt(n)! where wt(n) is the Hamming weight of n (A000120). 1
 1, 2, 3, 5, 6, 8, 10, 16, 17, 19, 21, 27, 29, 35, 41, 65, 66, 68, 70, 76, 78, 84, 90, 114, 116, 122, 128, 152, 158, 182, 206, 326, 327, 329, 331, 337, 339, 345, 351, 375, 377, 383, 389, 413, 419, 443, 467, 587, 589, 595, 601, 625, 631, 655, 679, 799, 805, 829, 853, 973, 997, 1117 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Partial sums of A093659, partial sums of the factorials of A000120. A000522 is a subsequence: A000522(n)=a(2^n-1). LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 FORMULA a(n)=sum(k=0,n,wt(k)!) where wt(k) is the Hamming weight of k. MATHEMATICA FoldList[Plus, 0!, Table[(Plus @@ IntegerDigits[n, 2])!, {n, 1, 70}]] (* From Olivier Gérard, Mar 23 2011 *) PROG (Pari) bitcount(x)= { /* Return Hamming weight of x */     local(p);  p = 0;     while ( x, p+=bitand(x, 1); x>>=1; );     return( p ); } N=65; /* that many terms */ f=vector(N, n, bitcount(n-1)!); /* factorials of Hamming weights */ s=vector(N); s[1]=f[1]; /* for cumulative sums */ for (n=2, N, s[n]=s[n-1]+f[n]); /* sum up */ s /* show terms */ /* Joerg Arndt, Mar 20 2011 */ CROSSREFS Cf. A093659, A000120, A000522. Sequence in context: A053873 A118053 A124145 * A104424 A028806 A028731 Adjacent sequences:  A188061 A188062 A188063 * A188065 A188066 A188067 KEYWORD nonn AUTHOR Joerg Arndt, Mar 20 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 06:05 EDT 2013. Contains 225428 sequences.