The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068916 Smallest positive integer that is equal to the sum of the n-th powers of its prime factors (counted with multiplicity). 5
 2, 16, 1096744, 3125, 256, 823543, 19683 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Does a(n) exist for all n? a(12)=65536, a(27)=4294967296. a(n) exists for all n of the form n=p^i-i, where p is prime and i > 0, since p^p^i is an example (see A067688 and A081177). - Jud McCranie, Mar 16 2003 a(23) <= 298023223876953125. a(24) <= 7625597484987. - Jud McCranie, Jan 18 2016 a(10) = 285311670611. - Jud McCranie, Jan 25 2016 a(24) = 7625597484987. - Jud McCranie, Jan 30 2016 LINKS Table of n, a(n) for n=1..7. S. P. Hurd and J. S. McCranie, Integers that are Sums of Uniform Powers of all their Prime Factors: the sequence A068916, J. of Int. Seq., vol 22, article 19.3.4. EXAMPLE a(3) = 1096744 = 2^3*11^3*103; the sum of the cubes of the prime factors is 3*2^3 + 3*11^3 + 103^3 = 1096744. MATHEMATICA a[n_] := For[x=1, True, x++, If[x==Plus@@(#[[2]]#[[1]]^n&/@FactorInteger[x]), Return[x]]] PROG (PARI) isok(k, n) = {my(f=factor(k)); sum(j=1, #f~, f[j, 2]*f[j, 1]^n) == k; } a(n) = {my(k = 1); while(! isok(k, n), k++); k; } \\ Michel Marcus, Jan 25 2016 (Python) from sympy import factorint def a(n): k = 1 while True: f = factorint(k) if k == sum(f[d]*d**n for d in f): return k k += 1 for n in range(1, 8): print(a(n), end=", ") # Michael S. Branicky, Feb 16 2021 CROSSREFS Cf. A067688, A268036. Cf. A081177, A000325, A024024, A024050. Sequence in context: A333540 A258169 A325048 * A093987 A275588 A114560 Adjacent sequences: A068913 A068914 A068915 * A068917 A068918 A068919 KEYWORD nonn,hard,more AUTHOR Dean Hickerson, Mar 07 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 12:31 EST 2023. Contains 367690 sequences. (Running on oeis4.)