A133150 - cp's OEIS frontend

A133150 a(n) = smallest 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	17
8	47
9	31
10	79
11	49
12	119
13	71
14	167
15	97
16	223
17	127
18	41
19	46
20	359
21	199
22	439
23	241
24	527
25	82
26	89
27	337
28	727
29	391
30	839
31	449
32	137
33	73
34	1087
35	577
36	1223
37	647
38	1367
39	103
40	217
41	94
42	1679
43	881
44	1847
45	967
46	119
47	151
48	2207
49	1151
50	2399
51	1249
52	113
53	193
54	401
55	1457

[0, 0, 0, 0, 14, 23, 17, 47, 31, 79, 49, 119, 71, 167, 97, 223, 127, 41, 46, 359, 199, 439, 241, 527, 82, 89, 337, 727, 391, 839, 449, 137, 73, 1087, 577, 1223, 647, 1367, 103, 217, 94, 1679, 881, 1847, 967, 119, 151, 2207, 1151, 2399, 1249, 113, 193, 401, 1457]

cp's OEIS Frontend

A133150 a(n) = smallest 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