A130703 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	0
4	0
5	9
6	14
7	10
8	27
9	35
10	22
11	18
12	65
13	77
14	18
15	26
16	119
17	27
18	38
19	34
20	27
21	209
22	46
23	28
24	55
25	299
26	36
27	35
28	377
29	45
30	62
31	58
32	45
33	527
34	40
35	54
36	629
37	95
38	54
39	74
40	779
41	63
42	86
43	82
44	63
45	989
46	94
47	54
48	161
49	235
50	68
51	91
52	265
53	81
54	65
55	106
56	81
57	145
58	118
59	90
60	1769
61	1829

[0, 0, 0, 0, 9, 14, 10, 27, 35, 22, 18, 65, 77, 18, 26, 119, 27, 38, 34, 27, 209, 46, 28, 55, 299, 36, 35, 377, 45, 62, 58, 45, 527, 40, 54, 629, 95, 54, 74, 779, 63, 86, 82, 63, 989, 94, 54, 161, 235, 68, 91, 265, 81, 65, 106, 81, 145, 118, 90, 1769, 1829]

cp's OEIS Frontend

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

Table of values

List of values