A354139 - cp's OEIS frontend

A354139 a(n) is the least positive integer m such that (k+1)^n + (k+2)^n + ... + (k+m)^n == 0 (mod n) for every positive integer k.

n	a(n)
1	1
2	4
3	3
4	8
5	5
6	36
7	7
8	16
9	3
10	20
11	11
12	72
13	13
14	28
15	15
16	32
17	17
18	108
19	19
20	200
21	21
22	44
23	23
24	144
25	5
26	52
27	3
28	56
29	29
30	180
31	31
32	64
33	33
34	68
35	35
36	216
37	37
38	76
39	39
40	400
41	41
42	1764
43	43
44	88
45	15
46	92
47	47
48	288
49	7
50	20
51	51
52	104
53	53
54	324
55	55
56	112
57	57
58	116
59	59
60	1800
61	61
62	124
63	21
64	128
65	65
66	396
67	67
68	136
69	69
70	140
71	71

[1, 4, 3, 8, 5, 36, 7, 16, 3, 20, 11, 72, 13, 28, 15, 32, 17, 108, 19, 200, 21, 44, 23, 144, 5, 52, 3, 56, 29, 180, 31, 64, 33, 68, 35, 216, 37, 76, 39, 400, 41, 1764, 43, 88, 15, 92, 47, 288, 7, 20, 51, 104, 53, 324, 55, 112, 57, 116, 59, 1800, 61, 124, 21, 128, 65, 396, 67, 136, 69, 140, 71]

cp's OEIS Frontend

A354139 a(n) is the least positive integer m such that (k+1)^n + (k+2)^n + ... + (k+m)^n == 0 (mod n) for every positive integer k.

Table of values

List of values