A184827 - cp's OEIS frontend

A184827 a(n) = largest k such that A000959(n+1) = A000959(n) + (A000959(n) mod k), or 0 if no such k exists.

n	a(n)
1	0
2	0
3	5
4	5
5	11
6	9
7	17
8	19
9	29
10	29
11	31
12	37
13	47
14	39
15	59
16	65
17	65
18	71
19	71
20	71
21	81
22	87
23	93
24	99
25	107
26	103
27	125
28	125
29	131
30	129
31	131
32	143
33	155
34	157
35	167
36	153
37	185
38	191
39	189
40	197
41	199
42	203
43	215
44	215
45	227
46	233
47	233
48	223
49	257
50	255
51	261
52	263

[0, 0, 5, 5, 11, 9, 17, 19, 29, 29, 31, 37, 47, 39, 59, 65, 65, 71, 71, 71, 81, 87, 93, 99, 107, 103, 125, 125, 131, 129, 131, 143, 155, 157, 167, 153, 185, 191, 189, 197, 199, 203, 215, 215, 227, 233, 233, 223, 257, 255, 261, 263]

cp's OEIS Frontend

A184827 a(n) = largest k such that A000959(n+1) = A000959(n) + (A000959(n) mod k), or 0 if no such k exists.

Table of values

List of values

n	a(n)
1	0
2	0
3	5
4	5
5	11
6	9
7	17
8	19
9	29
10	29
11	31
12	37
13	47
14	39
15	59
16	65
17	65
18	71
19	71
20	71
21	81
22	87
23	93
24	99
25	107
26	103
27	125
28	125
29	131
30	129
31	131
32	143
33	155
34	157
35	167
36	153
37	185
38	191
39	189
40	197
41	199
42	203
43	215
44	215
45	227
46	233
47	233
48	223
49	257
50	255
51	261
52	263

n	a(n)
1	0
2	0
3	5
4	5
5	11
6	9
7	17
8	19
9	29
10	29
11	31
12	37
13	47
14	39
15	59
16	65
17	65
18	71
19	71
20	71
21	81
22	87
23	93
24	99
25	107
26	103
27	125
28	125
29	131
30	129
31	131
32	143
33	155
34	157
35	167
36	153
37	185
38	191
39	189
40	197
41	199
42	203
43	215
44	215
45	227
46	233
47	233
48	223
49	257
50	255
51	261
52	263

n	a(n)
1	0
2	0
3	5
4	5
5	11
6	9
7	17
8	19
9	29
10	29
11	31
12	37
13	47
14	39
15	59
16	65
17	65
18	71
19	71
20	71
21	81
22	87
23	93
24	99
25	107
26	103
27	125
28	125
29	131
30	129
31	131
32	143
33	155
34	157
35	167
36	153
37	185
38	191
39	189
40	197
41	199
42	203
43	215
44	215
45	227
46	233
47	233
48	223
49	257
50	255
51	261
52	263