A317058 - cp's OEIS frontend

A317058 a(n) is the smallest composite k such that 1^(k-1) + 2^(k-1) + ... + n^(k-1) == n (mod k).

n	a(n)
1	4
2	341
3	473
4	4
5	4
6	133
7	497
8	4
9	4
10	15
11	9
12	4
13	4
14	143
15	35
16	4
17	4
18	51
19	57
20	4
21	4
22	77
23	253
24	4
25	4
26	65
27	9
28	4
29	4
30	115
31	155
32	4
33	4
34	187
35	35
36	4
37	4
38	9
39	247
40	4
41	4
42	287
43	2051
44	4
45	4
46	15
47	33
48	4
49	4
50	35
51	85
52	4
53	4
54	9
55	9
56	4
57	4
58	551
59	1711
60	4
61	4
62	713
63	21
64	4
65	4
66	55
67	77
68	4
69	4
70	35
71	35
72	4

[4, 341, 473, 4, 4, 133, 497, 4, 4, 15, 9, 4, 4, 143, 35, 4, 4, 51, 57, 4, 4, 77, 253, 4, 4, 65, 9, 4, 4, 115, 155, 4, 4, 187, 35, 4, 4, 9, 247, 4, 4, 287, 2051, 4, 4, 15, 33, 4, 4, 35, 85, 4, 4, 9, 9, 4, 4, 551, 1711, 4, 4, 713, 21, 4, 4, 55, 77, 4, 4, 35, 35, 4]

cp's OEIS Frontend

A317058 a(n) is the smallest composite k such that 1^(k-1) + 2^(k-1) + ... + n^(k-1) == n (mod k).

Table of values

List of values