This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027870 Number of zeros in 2^n. 29
 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 a(A007377(n)) = 0; A224782(n) <= a(n). - Reinhard Zumkeller, Apr 30 2013 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..20000 (first 1001 terms from Harry J. Smith) FORMULA a(n) = A055641(A000079(n)). - Reinhard Zumkeller, Apr 30 2013 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} ] DigitCount[2^Range[0, 110], 10, 0] (* Harvey P. Dale, Nov 20 2011 *) 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 (PARI) A027870(n)=#select(d->!d, digits(2^n)) \\ M. F. Hasler, Jun 14 2018 (Haskell) a027870 = a055641 . a000079  -- Reinhard Zumkeller, Apr 30 2013 CROSSREFS Cf. A007377, 1's A065712, 2's A065710, 3's A065714, 4's A065715, 5's A065716, 6's A065717, 7's A065718, 8's A065719, 9's A065744. Cf. A031146: index of first appearence of n in this sequence. Cf. A305932: table with n in row a(n). Sequence in context: A321900 A321895 A321899 * A070077 A255824 A122587 Adjacent sequences:  A027867 A027868 A027869 * A027871 A027872 A027873 KEYWORD nonn,base AUTHOR EXTENSIONS a(99)-a(104) from Harry J. Smith, Oct 27 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 15:28 EDT 2019. Contains 324194 sequences. (Running on oeis4.)