|
Search: id:A126762
|
|
|
| A126762 |
|
a(n) = least k such that the remainder when n^k is divided by k is n. |
|
+0
1
|
|
| 2, 3, 5, 5, 7, 7, 11, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 23, 21, 23, 23, 29, 25, 28, 27, 29, 29, 31, 31, 37, 33, 37, 35, 37, 37, 41, 39, 41, 41, 43, 43, 47, 45, 47, 47, 53, 49, 53, 51, 53, 53, 59, 55, 59, 57, 59, 59, 61, 61, 67, 63, 67, 65, 67, 67, 71, 69, 71, 71, 73, 73
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n)>n. a(n-1) = n for n = {2,3,5,7,9,11,13,15,17,19,21,23,25,27,29,...} = 2 together with odd numbers n>1. a(p) = next prime for prime p. a(n) coincides with A082048(n) up to n=24.
|
|
MATHEMATICA
|
Table[Min[Select[Range[101], PowerMod[n, #, # ]==n&]], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A128149 = Least k such that n^k (mod k) = n-1. Cf. A128172 = Least k such that n^k (mod k) = n+1. Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160. Cf. A082048 = least number greater than n having greater smallest prime factor than that of n.
Sequence in context: A115732 A048947 A114519 this_sequence A082048 A113459 A159477
Adjacent sequences: A126759 A126760 A126761 this_sequence A126763 A126764 A126765
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 17 2007
|
|
|
Search completed in 0.002 seconds
|
