|
|
A036555
|
|
Hamming weight of 3n: number of 1's in binary expansion of 3n.
|
|
7
|
|
|
0, 2, 2, 2, 2, 4, 2, 3, 2, 4, 4, 2, 2, 4, 3, 4, 2, 4, 4, 4, 4, 6, 2, 3, 2, 4, 4, 3, 3, 5, 4, 5, 2, 4, 4, 4, 4, 6, 4, 5, 4, 6, 6, 2, 2, 4, 3, 4, 2, 4, 4, 4, 4, 6, 3, 4, 3, 5, 5, 4, 4, 6, 5, 6, 2, 4, 4, 4, 4, 6, 4, 5, 4, 6, 6, 4, 4, 6, 5, 6, 4, 6, 6, 6, 6, 8, 2, 3, 2, 4, 4, 3, 3, 5, 4, 5, 2, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is also the largest integer such that 2^a(n) divides binomial(6n,3n)=A066802(n). - Benoit Cloitre, Mar 27 2002
|
|
LINKS
|
|
|
MAPLE
|
t1:=[];
for n from 0 to 100 do t2:=convert(3*n, base, 2); t3:=add(t2[i], i=1..nops(t2)); t1:=[op(t1), t3]; od:
t1;
|
|
MATHEMATICA
|
Total/@IntegerDigits[3Range[0, 100], 2] (* Harvey P. Dale, Oct 03 2011 *)
|
|
PROG
|
(Haskell)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|