|
Search: id:A128150
|
|
|
| A128150 |
|
Least k such that n^k (mod k) = (n-1)^2. |
|
+0
22
|
| |
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
a(13)-a(14) = {14873, 1465}. a(16) = 4247. a(18)-a(19) = {526673, 835}. a(24)-a(25) = {6385, 5809}. a(27) = 299651. a(29) = 2645. a(32) = 725521. - Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 17 2007
|
|
EXAMPLE
|
a(3) = A078457(2^2) = 41459.
a(5) = A119679(4^2) = 9569200211.
a(6) = A127816(5^2) = 2673413.
a(7) = A119715(6^2) = 10596486211.
|
|
CROSSREFS
|
Cf. A128148, A128150 = Least k such that n^k (mod k) = n-1. Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821.
Cf. A128172 = Least k such that n^k (mod k) = n+1. Cf. A128154, A128155, A128156, A128157, A128158, A128159, A128160.
Sequence in context: A141711 A074379 A027577 this_sequence A002879 A028239 A031849
Adjacent sequences: A128147 A128148 A128149 this_sequence A128151 A128152 A128153
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 16 2007, May 06 2007
|
|
EXTENSIONS
|
More terms from Alexander Adamchuk (alex(AT)kolmogorov.com), Dec 24 2007
|
|
|
Search completed in 0.002 seconds
|
