A228919 - cp's OEIS frontend

A228919 Numbers n such that 1^(n+1) + 2^(n+1) + ... + n^(n+1) == 0 (mod n).

n	a(n)
1	1
2	4
3	5
4	7
5	8
6	11
7	12
8	13
9	16
10	17
11	19
12	20
13	23
14	24
15	25
16	28
17	29
18	31
19	32
20	36
21	37
22	40
23	41
24	43
25	44
26	47
27	48
28	49
29	52
30	53
31	56
32	59
33	60
34	61
35	64
36	65
37	67
38	68
39	71
40	72
41	73
42	76
43	79
44	80
45	83
46	84
47	85
48	88
49	89
50	91
51	92
52	96
53	97
54	100
55	101
56	103
57	104
58	107
59	108
60	109
61	112
62	113
63	116

[1, 4, 5, 7, 8, 11, 12, 13, 16, 17, 19, 20, 23, 24, 25, 28, 29, 31, 32, 36, 37, 40, 41, 43, 44, 47, 48, 49, 52, 53, 56, 59, 60, 61, 64, 65, 67, 68, 71, 72, 73, 76, 79, 80, 83, 84, 85, 88, 89, 91, 92, 96, 97, 100, 101, 103, 104, 107, 108, 109, 112, 113, 116]

cp's OEIS Frontend

A228919 Numbers n such that 1^(n+1) + 2^(n+1) + ... + n^(n+1) == 0 (mod n).

Table of values

List of values

n	a(n)
1	1
2	4
3	5
4	7
5	8
6	11
7	12
8	13
9	16
10	17
11	19
12	20
13	23
14	24
15	25
16	28
17	29
18	31
19	32
20	36
21	37
22	40
23	41
24	43
25	44
26	47
27	48
28	49
29	52
30	53
31	56
32	59
33	60
34	61
35	64
36	65
37	67
38	68
39	71
40	72
41	73
42	76
43	79
44	80
45	83
46	84
47	85
48	88
49	89
50	91
51	92
52	96
53	97
54	100
55	101
56	103
57	104
58	107
59	108
60	109
61	112
62	113
63	116

n	a(n)
1	1
2	4
3	5
4	7
5	8
6	11
7	12
8	13
9	16
10	17
11	19
12	20
13	23
14	24
15	25
16	28
17	29
18	31
19	32
20	36
21	37
22	40
23	41
24	43
25	44
26	47
27	48
28	49
29	52
30	53
31	56
32	59
33	60
34	61
35	64
36	65
37	67
38	68
39	71
40	72
41	73
42	76
43	79
44	80
45	83
46	84
47	85
48	88
49	89
50	91
51	92
52	96
53	97
54	100
55	101
56	103
57	104
58	107
59	108
60	109
61	112
62	113
63	116

n	a(n)
1	1
2	4
3	5
4	7
5	8
6	11
7	12
8	13
9	16
10	17
11	19
12	20
13	23
14	24
15	25
16	28
17	29
18	31
19	32
20	36
21	37
22	40
23	41
24	43
25	44
26	47
27	48
28	49
29	52
30	53
31	56
32	59
33	60
34	61
35	64
36	65
37	67
38	68
39	71
40	72
41	73
42	76
43	79
44	80
45	83
46	84
47	85
48	88
49	89
50	91
51	92
52	96
53	97
54	100
55	101
56	103
57	104
58	107
59	108
60	109
61	112
62	113
63	116