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.

A069263 (Sum of digits of n)^3 = sum of digits of n^3.

Original entry on oeis.org

1, 2, 10, 11, 20, 100, 101, 110, 111, 200, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 2000, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 11000, 11001, 11010, 11011, 11100, 20000, 100000
Offset: 1

Views

Author

Joseph L. Pe, Apr 19 2002

Keywords

Examples

			Let s(n) = sum of digits of n. Then s(101)^3 = 8 and s(101^3) = s(1030301) = 8, so 101 belongs to the sequence.
		

Crossrefs

Cf. A061909.

Programs

  • Mathematica
    f[n_] := Apply[Plus, IntegerDigits[n]]; Select[Range[10^5], f[ #^3] == f[ # ]^3 &]
  • PARI
    is(n)=sumdigits(n^3)==sumdigits(n)^3 \\ Charles R Greathouse IV, Dec 19 2016