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-1 of 1 results.

A240387 Least k such that sum of n-th power of digits of k equals sum of prime divisors of k.

Original entry on oeis.org

2, 12, 142, 210, 22011, 210120, 101220, 11012210, 2202120, 11210021221, 1100200012, 1000200000111, 1211201222, 211222020, 101101001120
Offset: 1

Views

Author

Michel Lagneau, Apr 04 2014

Keywords

Comments

a(16) <= 1001110220200020. - Giovanni Resta, Apr 07 2014

Examples

			a(5) = 22011 =  3*11*23*29 because 2^5 + 2^5 + 0^5 + 1^5 + 1^5 = 3 + 11 + 23 + 29 = 66.
		

Crossrefs

Programs

  • Mathematica
    Do[k=2;While[!Total[Transpose[FactorInteger[k]][[1]]]==Total[IntegerDigits[k]^n],k++];Print[n," ",k],{n,1,15}]
Showing 1-1 of 1 results.