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

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

Table of n, a(n) for n=1..8.

J. M. 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].

Formula

a(2) = A229303(1), a(3) = A229302(1), a(4) = A229301(1), a(5) = A229300, a(6) = A229312(1).

Example

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

Crossrefs

Cf. A031971, A229300, A229301, A229302, A229303, A230311.

Sequence in context: A226260 A102060 A102058 * A031364 A078473 A215833

Adjacent sequences: A231406 A231407 A231408 * A231410 A231411 A231412

Keyword

nonn,more,hard

Author

Jonathan Sondow, Nov 30 2013

Status

approved