OFFSET
1,2
COMMENTS
Let n be a k-digit number. Then, sigma(n) >= 10^(k-1) and (9*k)^4 >= sum_of_digits(n)^4. So, n must be less than 10^9. - Hiroaki Yamanouchi, Aug 29 2015
EXAMPLE
510 is in the sequence, since (1 + 2 + 3 + 5 + ... + 255 + 510) = (5 + 1 + 0)^4.
MATHEMATICA
n = 10000000;
list = {};
x = 1;
While[x <= n,
If[Total[Divisors[x]] == Total[IntegerDigits[x]]^4,
AppendTo[list, x]];
x = x + 1
];
list
PROG
(PARI) isok(n) = sigma(n) == sumdigits(n)^4; \\ Michel Marcus, Aug 06 2015
(Magma) [n: n in [1..3*10^6] | DivisorSigma(1, n) eq (&+Intseq(n)^4)]; // Vincenzo Librandi, Aug 29 2015
CROSSREFS
KEYWORD
nonn,base,fini,full,less
AUTHOR
Michael Savoric, Aug 05 2015
STATUS
approved