A130650 - cp's OEIS frontend

A130650 a(n) = smallest 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	4
4	13
5	2
6	13
7	18
8	4
9	43
10	8
11	3
12	41
13	4
14	4
15	3
16	13
17	2
18	37
19	16
20	43
21	97
22	4
23	9
24	10
25	53
26	4
27	5
28	10
29	3
30	6
31	61
32	43
33	2
34	11
35	2
36	12
37	163
38	8
39	13
40	2
41	5
42	173
43	8
44	89
45	4
46	3
47	37
48	61
49	101
50	101
51	107
52	229
53	113

[0, 0, 4, 13, 2, 13, 18, 4, 43, 8, 3, 41, 4, 4, 3, 13, 2, 37, 16, 43, 97, 4, 9, 10, 53, 4, 5, 10, 3, 6, 61, 43, 2, 11, 2, 12, 163, 8, 13, 2, 5, 173, 8, 89, 4, 3, 37, 61, 101, 101, 107, 229, 113]

cp's OEIS Frontend

A130650 a(n) = smallest 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	4
4	13
5	2
6	13
7	18
8	4
9	43
10	8
11	3
12	41
13	4
14	4
15	3
16	13
17	2
18	37
19	16
20	43
21	97
22	4
23	9
24	10
25	53
26	4
27	5
28	10
29	3
30	6
31	61
32	43
33	2
34	11
35	2
36	12
37	163
38	8
39	13
40	2
41	5
42	173
43	8
44	89
45	4
46	3
47	37
48	61
49	101
50	101
51	107
52	229
53	113

n	a(n)
1	0
2	0
3	4
4	13
5	2
6	13
7	18
8	4
9	43
10	8
11	3
12	41
13	4
14	4
15	3
16	13
17	2
18	37
19	16
20	43
21	97
22	4
23	9
24	10
25	53
26	4
27	5
28	10
29	3
30	6
31	61
32	43
33	2
34	11
35	2
36	12
37	163
38	8
39	13
40	2
41	5
42	173
43	8
44	89
45	4
46	3
47	37
48	61
49	101
50	101
51	107
52	229
53	113

n	a(n)
1	0
2	0
3	4
4	13
5	2
6	13
7	18
8	4
9	43
10	8
11	3
12	41
13	4
14	4
15	3
16	13
17	2
18	37
19	16
20	43
21	97
22	4
23	9
24	10
25	53
26	4
27	5
28	10
29	3
30	6
31	61
32	43
33	2
34	11
35	2
36	12
37	163
38	8
39	13
40	2
41	5
42	173
43	8
44	89
45	4
46	3
47	37
48	61
49	101
50	101
51	107
52	229
53	113