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.

Showing 1-2 of 2 results.

A052004 Numbers k such that k^3 has only even digits.

Original entry on oeis.org

0, 2, 4, 20, 40, 200, 202, 400, 1822, 1824, 1902, 2000, 2002, 2020, 4000, 4352, 18220, 18240, 19020, 20000, 20002, 20020, 20200, 34372, 39154, 40000, 43520, 182200, 182400, 190200, 200000, 200002, 200020, 200200, 202000, 297092, 343720, 391540
Offset: 1

Views

Author

Patrick De Geest, Nov 15 1999

Keywords

Crossrefs

Programs

  • Mathematica
    Select[ Range[ 500000 ], Union[ EvenQ[ IntegerDigits[ #^3 ] ] ] == {True} & ]
    Select[Range[0,400000],AllTrue[IntegerDigits[#^3],EvenQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Oct 15 2017 *)

A076165 Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.

Original entry on oeis.org

14467, 14476, 14647, 14674, 14746, 14764, 16447, 16474, 16744, 17446, 17464, 17644, 41467, 41476, 41647, 41674, 41746, 41764, 44167, 44176, 44617, 44671, 44716, 44761, 46147, 46174, 46417, 46471, 46714, 46741, 47146, 47164, 47416
Offset: 1

Views

Author

Zak Seidov, Nov 01 2002

Keywords

Comments

Minimal number of digits in n is 5.
n such that sum of even digits equals sum of odd digits in A036301.

Examples

			14467 is OK because 1^3+7^3=4^3+4^3+6^3.
		

Crossrefs

Programs

  • Mathematica
    oeQ[n_]:=Module[{idn = IntegerDigits[n]},Total[Select[idn, OddQ]^3] == Total[Select[idn, EvenQ]^3]]; Select[Range[100000],oeQ] (* Harvey P. Dale, Sep 23 2011 *)
  • PARI
    ok(n)={my(v=digits(n)); sum(i=1, #v, v[i]^3*if(v[i]%2, 1, -1))==0} \\ Andrew Howroyd, Dec 10 2018
Showing 1-2 of 2 results.