A133151 - cp's OEIS frontend

A133151 a(n) = smallest k such that A000326(n+1) = A000326(n) + (A000326(n) mod k), or 0 if no such k exists.

n	a(n)
1	0
2	0
3	0
4	0
5	19
6	32
7	24
8	67
9	89
10	38
11	71
12	173
13	69
14	61
15	71
16	109
17	373
18	211
19	79
20	529
21	587
22	72
23	89
24	779
25	283
26	461
27	499
28	359
29	1159
30	311
31	111
32	1423
33	1517
34	269
35	857
36	1817
37	641
38	127
39	134
40	251
41	2377
42	1249
43	138
44	2749
45	2879
46	251
47	787
48	173
49	381
50	1787
51	1861
52	1291

[0, 0, 0, 0, 19, 32, 24, 67, 89, 38, 71, 173, 69, 61, 71, 109, 373, 211, 79, 529, 587, 72, 89, 779, 283, 461, 499, 359, 1159, 311, 111, 1423, 1517, 269, 857, 1817, 641, 127, 134, 251, 2377, 1249, 138, 2749, 2879, 251, 787, 173, 381, 1787, 1861, 1291]

cp's OEIS Frontend

A133151 a(n) = smallest k such that A000326(n+1) = A000326(n) + (A000326(n) mod k), or 0 if no such k exists.

Table of values

List of values