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.

A065719 Number of 8's in decimal expansion of 2^n.

Original entry on oeis.org

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

Views

Author

Benoit Cloitre, Dec 04 2001

Keywords

Comments

2^7 = 128 so a(7)=1.

Crossrefs

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

Programs

  • Mathematica
    Table[ Count[ IntegerDigits[2^n], 8], {n, 0, 100} ]
    DigitCount[2^Range[0,100],10,8] (* Harvey P. Dale, Aug 02 2024 *)
  • PARI
    a(n) = #select(x->(x==8), digits(2^n)); \\ Michel Marcus, Jun 15 2018
    
  • Python
    def A065719(n):
        return str(2**n).count('8') # Chai Wah Wu, Feb 14 2020

Extensions

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