cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A065718 Number of 7's in decimal expansion of 2^n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 3, 0, 1, 2, 0, 1, 2, 1, 1, 0, 2, 1, 3, 2, 3, 1, 3, 0, 0, 1, 1, 1, 4, 2, 3, 0, 0, 1, 2, 2, 0, 2, 4, 2, 3, 2, 1, 0, 2, 3, 3, 1, 3, 3, 2, 2, 2, 0, 1, 3, 2, 5, 3, 3, 2, 2, 3, 1, 3, 3, 1, 2, 4, 2, 2, 2, 2, 5, 2, 1, 2, 5, 2, 4, 4, 2, 3
Offset: 0

Views

Author

Benoit Cloitre, Dec 04 2001

Keywords

Examples

			2^15 = 32768 so a(15)=1.
		

Crossrefs

Cf. 0's A027870, 1's A065712, 2's A065710, 3's A065714, 4's A065715, 5's A065716, 6's A065717, 8's A065719, 9's A065744.

Programs

  • Mathematica
    Table[ Count[ IntegerDigits[2^n], 7], {n, 0, 100} ]
  • PARI
    a(n) = #select(x->(x==7), digits(2^n)); \\ Michel Marcus, Jun 15 2018
    
  • Python
    def A065718(n):
        return str(2**n).count('7') # Chai Wah Wu, Feb 14 2020

Extensions

More terms from Robert G. Wilson v, Dec 07 2001

A306112 Largest k such that 2^k has exactly n digits 0 (in base 10), conjectured.

Original entry on oeis.org

86, 229, 231, 359, 283, 357, 475, 476, 649, 733, 648, 696, 824, 634, 732, 890, 895, 848, 823, 929, 1092, 1091, 1239, 1201, 1224, 1210, 1141, 1339, 1240, 1282, 1395, 1449, 1416, 1408, 1616, 1524, 1727, 1725, 1553, 1942, 1907, 1945, 1870, 1724, 1972, 1965, 2075, 1983, 2114, 2257, 2256
Offset: 0

Views

Author

M. F. Hasler, Jun 22 2018

Keywords

Comments

a(0) is the largest term in A007377: exponents of powers of 2 without digit 0.
There is no proof for any of the terms, just as for any term of A020665 and many similar / related sequences. However, the search has been pushed to many magnitudes beyond the largest known term, and the probability of any of the terms being wrong is extremely small, cf., e.g., the Khovanova link.

Crossrefs

Cf. A031146: least k such that 2^k has n digits 0 in base 10.
Cf. A305942: number of k's such that 2^k has n digits 0.
Cf. A305932: row n lists exponents of 2^k with n digits 0.
Cf. A007377: { k | 2^k has no digit 0 } : row 0 of the above.
Cf. A238938: { 2^k having no digit 0 }.
Cf. A027870: number of 0's in 2^n (and A065712, A065710, A065714, A065715, A065716, A065717, A065718, A065719, A065744 for digits 1 .. 9).
Cf. A102483: 2^n contains no 0 in base 3.

Programs

  • PARI
    A306112_vec(nMax,M=99*nMax+199,x=2,a=vector(nMax+=2))={for(k=0,M,a[min(1+#select(d->!d,digits(x^k)),nMax)]=k);a[^-1]}
Previous Showing 11-12 of 12 results.