A184752 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	16
4	13
5	26
6	26
7	18
8	40
9	43
10	40
11	48
12	41
13	60
14	64
15	66
16	65
17	74
18	74
19	64
20	86
21	97
22	96
23	99
24	100
25	106
26	112
27	115
28	110
29	123
30	120
31	122
32	129
33	146
34	143
35	152
36	144
37	163
38	160
39	169
40	170
41	170
42	173
43	168
44	178
45	184
46	186
47	185
48	183
49	202
50	202
51	214

[0, 0, 16, 13, 26, 26, 18, 40, 43, 40, 48, 41, 60, 64, 66, 65, 74, 74, 64, 86, 97, 96, 99, 100, 106, 112, 115, 110, 123, 120, 122, 129, 146, 143, 152, 144, 163, 160, 169, 170, 170, 173, 168, 178, 184, 186, 185, 183, 202, 202, 214]

cp's OEIS Frontend

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

Table of values

List of values

n	a(n)
1	0
2	0
3	16
4	13
5	26
6	26
7	18
8	40
9	43
10	40
11	48
12	41
13	60
14	64
15	66
16	65
17	74
18	74
19	64
20	86
21	97
22	96
23	99
24	100
25	106
26	112
27	115
28	110
29	123
30	120
31	122
32	129
33	146
34	143
35	152
36	144
37	163
38	160
39	169
40	170
41	170
42	173
43	168
44	178
45	184
46	186
47	185
48	183
49	202
50	202
51	214

n	a(n)
1	0
2	0
3	16
4	13
5	26
6	26
7	18
8	40
9	43
10	40
11	48
12	41
13	60
14	64
15	66
16	65
17	74
18	74
19	64
20	86
21	97
22	96
23	99
24	100
25	106
26	112
27	115
28	110
29	123
30	120
31	122
32	129
33	146
34	143
35	152
36	144
37	163
38	160
39	169
40	170
41	170
42	173
43	168
44	178
45	184
46	186
47	185
48	183
49	202
50	202
51	214

n	a(n)
1	0
2	0
3	16
4	13
5	26
6	26
7	18
8	40
9	43
10	40
11	48
12	41
13	60
14	64
15	66
16	65
17	74
18	74
19	64
20	86
21	97
22	96
23	99
24	100
25	106
26	112
27	115
28	110
29	123
30	120
31	122
32	129
33	146
34	143
35	152
36	144
37	163
38	160
39	169
40	170
41	170
42	173
43	168
44	178
45	184
46	186
47	185
48	183
49	202
50	202
51	214