login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A202240
a(n) is the smallest number k such that the sum of the n-th powers of the digits of k equals the sum of the divisors of k other than 1 and k.
3
125, 142, 1005, 118678, 706862, 18481615, 122003411, 30330043, 5923078409, 22110133333, 120175787632, 5971473681952
OFFSET
2,1
EXAMPLE
a(5) = 118678 because 1^5 + 1^5 + 8^5 + 6^5 + 7^5 + 8^5 = 90121, and sum of the divisors 1 < d < a(5) = sigma(118678) - 118678 - 1 = 90121.
PROG
(PARI) f(k, n) = my(d=digits(k)); sum(i=1, #d, d[i]^n);
a(n) = my(k=1); while(f(k, n) != sigma(k)-k-1, k++); k; \\ Michel Marcus, Sep 29 2018
CROSSREFS
Cf. A070308 (n=2, "Canada perfect numbers").
Cf. A202279 (n=3), A202147 (n=4), A202285 (n=5).
Sequence in context: A046759 A115938 A126895 * A069656 A196943 A307386
KEYWORD
nonn,hard,base,more
AUTHOR
Michel Lagneau, Dec 16 2011
EXTENSIONS
a(8)-a(9) added by Amiram Eldar, Sep 29 2018
a(10)-a(13) from Giovanni Resta, Oct 04 2018
STATUS
approved