The On-Line Encyclopedia of Integer Sequences (OEIS)

A231409 revision #6

A231409

Least k with 1^(k*m) + 2^(k*m) + ... + (k*m)^(k*m) == k (mod k*m) for m in A230311.

1, 1, 1, 1, 1, 5, 5, 39607528021345872635

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,6

COMMENTS

Least k with A031971(k*m) == k (mod k*m) for m in A230311.

See A031971 and A230311 for more comments and crossrefs.

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, arXiv:1309.7941 [math.NT].

EXAMPLE

1^m + 2^m + ... + m^m == 1 (mod m) for the first 5 terms 1, 2, 6, 42, 1806 of A230311, so a(n) = 1 for n <= 5.

CROSSREFS

KEYWORD

nonn,more,hard

AUTHOR

STATUS

editing