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.

A269248 Number of times the digit 8 appears in the decimal expansion of n^3.

Original entry on oeis.org

0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 2, 0, 0, 1, 0, 0, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 3, 1, 2, 1, 2, 0, 0, 0, 0
Offset: 0

Views

Author

M. F. Hasler, Feb 20 2016

Keywords

Comments

The cubes corresponding to the first occurrence of 1, 2, 3, ... are listed in A036535, i.e., A036535(n)^(1/3) = A048373(n) is the index of the first occurrence of n.

Examples

			0^3 = 0, 1^3 = 1, 3^3 = 27 and 4^3 = 64 all have a(0) = a(1) = a(3) = a(4) = 0 digits '8'.
2^3 = 8 has a(2) = 1 digit '8'.
		

Crossrefs

Analog for other digits 0, 1, ..., 7, 9: A269250, A269241, A269242, A269243, A269244, A269245, A269246, A269247, A269249.
Analog for squares: A086016, and A086008 - A086017 for digits 0 - 9.

Programs

  • Mathematica
    Table[DigitCount[n^3, 10, 8], {n, 0, 100}] (* Robert Price, Mar 21 2020 *)
  • PARI
    A269248(n)=#select(t->t==8,digits(n^3))