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.

A107679 Numbers n such that sum of digits of n^3 is 2^3 = 8.

Original entry on oeis.org

2, 5, 8, 11, 20, 50, 80, 101, 110, 200, 500, 800, 1001, 1010, 1100, 2000, 5000, 8000, 10001, 10010, 10100, 11000, 20000, 50000, 80000, 100001, 100010, 100100, 101000, 110000, 200000, 500000, 800000, 1000001, 1000010, 1000100, 1001000, 1010000, 1100000
Offset: 1

Views

Author

Zak Seidov, Jun 10 2005

Keywords

Crossrefs

Cf. A004164 (sum of digits of cubes), A067075, A159462, A159463.

Programs

  • Magma
    [ n: n in [1..2*10^6] | 8 eq (&+Intseq(n^3)) ]; // Vincenzo Librandi, Aug 13 2017
  • Mathematica
    Do[If[Total[IntegerDigits[m^3]]==8, Print[m]], {m, 2*10^7}] (* Vincenzo Librandi, Aug 13 2017 *)
  • PARI
    isok(n) = sumdigits(n^3) == 8; \\ Michel Marcus, Aug 12 2017
    

Extensions

More terms from Michel Marcus, Oct 09 2013