A328920 - cp's OEIS frontend

A328920 let f(N) be the smallest index m such that from the m-th term on, the sequence {k^k mod N: k >= 0} enters into a cycle, then a(n) is the smallest number N such that f(N) = n, or 0 if no such n exists.

n	a(n)
0	1
1	2
2	0
3	8
4	81
5	0
6	15625
7	128
8	5764801
9	0
10	0
11	2048
12	3138428376721
13	1594323
14	3937376385699289
15	32768
16	43046721
17	0
18	14063084452067724991009
19	524288
20	37589973457545958193355601
21	476837158203125
22	31381059609
23	8388608
24	480250763996501976790165756943041
25	847288609443
26	0
27	134217728
28	0
29	3219905755813179726837607

[1, 2, 0, 8, 81, 0, 15625, 128, 5764801, 0, 0, 2048, 3138428376721, 1594323, 3937376385699289, 32768, 43046721, 0, 14063084452067724991009, 524288, 37589973457545958193355601, 476837158203125, 31381059609, 8388608, 480250763996501976790165756943041, 847288609443, 0, 134217728, 0, 3219905755813179726837607]

cp's OEIS Frontend

A328920 let f(N) be the smallest index m such that from the m-th term on, the sequence {k^k mod N: k >= 0} enters into a cycle, then a(n) is the smallest number N such that f(N) = n, or 0 if no such n exists.

Table of values

List of values