|
Search: id:A128452
|
|
|
| A128452 |
|
Least number k>n such that k^2 divides n^k - 1. |
|
+0
5
|
|
| 4, 21, 6, 1555, 8, 889, 10, 111, 12, 253, 14, 2041, 16, 21, 18, 128583032925805678351, 20, 1432001198261, 22
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
a(2n-1) = 2n. p divides a(p+1) for prime p. Quotients a(p+1)/p for prime p = Prime[n] are listed in A128456(n) = {2,7,311,127,23,157,...}, which coincides with A128357(n) from n = 2 up to n = 6.
|
|
CROSSREFS
|
Cf. A128456, A128357, A128356 = Least number k>1 (that is not the power of prime p) such that k divides (p+1)^k-1, where p = Prime[n]. Cf. A127103, A127104, A127105, A127106, A127107, A127102, A127101, A127100, A127092, A128393, A128394, A128395, A128396, A128397, A128398, A128399, A128400, A128401, A128402, A128403, A128404.
Sequence in context: A146342 A103896 A083192 this_sequence A144292 A076943 A138228
Adjacent sequences: A128449 A128450 A128451 this_sequence A128453 A128454 A128455
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 05 2007. Mar 09 2007
|
|
EXTENSIONS
|
More terms from Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 09 2007
|
|
|
Search completed in 0.002 seconds
|
