login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A214562
Number of 0's in binary expansion of n^n.
2
0, 0, 2, 1, 8, 6, 10, 9, 24, 15, 23, 19, 34, 21, 31, 26, 64, 39, 49, 40, 61, 44, 63, 46, 95, 59, 82, 61, 98, 79, 97, 71, 160, 88, 112, 92, 129, 96, 115, 109, 160, 105, 131, 118, 178, 125, 159, 134, 228, 138, 178, 146, 207, 141, 183, 154, 245, 161, 192, 167, 231, 195
OFFSET
0,3
LINKS
FORMULA
a(n) = A023416(A000312(n)).
a(2^k) = k*2^k. - Chai Wah Wu, Dec 24 2024
PROG
(Python)
for n in range(300):
c = 0
b = int(n**n)
while b>0:
c += 1-(b&1)
b//=2
print( c, end=", ")
(PARI) vector(66, n, b=binary((n-1)^(n-1)); sum(j=1, #b, 1-b[j])) /* Joerg Arndt, Jul 21 2012 */
CROSSREFS
KEYWORD
nonn,base,changed
AUTHOR
Alex Ratushnyak, Jul 21 2012
STATUS
approved