OFFSET
1,2
COMMENTS
Least such k is A231409. No other terms for n < 10^110 (see Grau, Oller-Marcen, Sondow (2015) p. 428). - Jonathan Sondow, Nov 30 2013
Same as quotients Q = m/n of solutions to the congruence 1^m + 2^m + . . . + m^m == n (mod m) with n|m. For Q > 1, a necessary condition is that Q be a primary pseudoperfect number A054377. The condition is not sufficient since the primary pseudoperfect number 52495396602 is not a member. - Jonathan Sondow, Jul 13 2014
LINKS
Jose María Grau, A. M. Oller-Marcen, and J. Sondow, On the congruence 1^m + 2^m + . . . + m^m == n (mod m) with n|m, Monatshefte für Mathematik 177 (2015) 421-436, DOI 10.1007/s00605-014-0660-0
FORMULA
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
José María Grau Ribas, Nov 06 2013
EXTENSIONS
Definition corrected by Jonathan Sondow, Nov 30 2013
STATUS
approved