|
|
A027870
|
|
Number of zeros in 2^n.
|
|
32
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 3, 1, 1, 1, 1, 1, 0, 1, 0, 2, 3, 2, 2, 2, 1, 1, 2, 2, 3, 2, 2, 2, 1, 1, 0, 1, 3, 3, 1, 0, 1, 1, 1, 0, 0, 2, 4, 2, 0, 2, 3, 1, 1, 0, 3, 5, 3, 3, 4, 2, 3, 4, 1, 1, 4, 5, 5, 6, 6, 7, 5, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,43
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
2^31 = 2147483648 so a(31) = 0 and 2^42 = 4398046511104 so a(42) = 2.
|
|
MATHEMATICA
|
Table[ Count[ IntegerDigits[2^n], 0], {n, 0, 100} ]
|
|
PROG
|
(PARI) Count(x, d)= { local(c=0, f); while (x>9, f=x-10*(x\10); if (f==d, c++); x\=10); if (x==d, c++); return(c) }
{ for (n=0, 1000, a=Count(2^n, 0); write("b027870.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 27 2009
(Python)
|
|
CROSSREFS
|
Cf. A031146: index of first appearence of n in this sequence.
Cf. A305932: table with n in row a(n).
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|