A184220 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	0
4	0
5	14
6	23
7	34
8	47
9	62
10	79
11	98
12	119
13	142
14	167
15	194
16	223
17	254
18	287
19	322
20	359
21	398
22	439
23	482
24	527
25	574
26	623
27	674
28	727
29	782
30	839
31	898
32	959
33	1022
34	1087
35	1154
36	1223
37	1294
38	1367
39	1442
40	1519
41	1598
42	1679
43	1762

[0, 0, 0, 0, 14, 23, 34, 47, 62, 79, 98, 119, 142, 167, 194, 223, 254, 287, 322, 359, 398, 439, 482, 527, 574, 623, 674, 727, 782, 839, 898, 959, 1022, 1087, 1154, 1223, 1294, 1367, 1442, 1519, 1598, 1679, 1762]

cp's OEIS Frontend

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

Table of values

List of values