A184830 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	2
4	3
5	3
6	6
7	7
8	7
9	9
10	10
11	15
12	15
13	15
14	21
15	23
16	25
17	27
18	30
19	27
20	33
21	39
22	39
23	45
24	45
25	47
26	57
27	58
28	61
29	63
30	69
31	67
32	77
33	79
34	77
35	81
36	93
37	99
38	99
39	105
40	105
41	105
42	117
43	123
44	126
45	125
46	125
47	135
48	129
49	147
50	145
51	151
52	159
53	165
54	165
55	167
56	177
57	171
58	189
59	189
60	195

[0, 0, 2, 3, 3, 6, 7, 7, 9, 10, 15, 15, 15, 21, 23, 25, 27, 30, 27, 33, 39, 39, 45, 45, 47, 57, 58, 61, 63, 69, 67, 77, 79, 77, 81, 93, 99, 99, 105, 105, 105, 117, 123, 126, 125, 125, 135, 129, 147, 145, 151, 159, 165, 165, 167, 177, 171, 189, 189, 195]

cp's OEIS Frontend

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

Table of values

List of values

n	a(n)
1	0
2	0
3	2
4	3
5	3
6	6
7	7
8	7
9	9
10	10
11	15
12	15
13	15
14	21
15	23
16	25
17	27
18	30
19	27
20	33
21	39
22	39
23	45
24	45
25	47
26	57
27	58
28	61
29	63
30	69
31	67
32	77
33	79
34	77
35	81
36	93
37	99
38	99
39	105
40	105
41	105
42	117
43	123
44	126
45	125
46	125
47	135
48	129
49	147
50	145
51	151
52	159
53	165
54	165
55	167
56	177
57	171
58	189
59	189
60	195

n	a(n)
1	0
2	0
3	2
4	3
5	3
6	6
7	7
8	7
9	9
10	10
11	15
12	15
13	15
14	21
15	23
16	25
17	27
18	30
19	27
20	33
21	39
22	39
23	45
24	45
25	47
26	57
27	58
28	61
29	63
30	69
31	67
32	77
33	79
34	77
35	81
36	93
37	99
38	99
39	105
40	105
41	105
42	117
43	123
44	126
45	125
46	125
47	135
48	129
49	147
50	145
51	151
52	159
53	165
54	165
55	167
56	177
57	171
58	189
59	189
60	195

n	a(n)
1	0
2	0
3	2
4	3
5	3
6	6
7	7
8	7
9	9
10	10
11	15
12	15
13	15
14	21
15	23
16	25
17	27
18	30
19	27
20	33
21	39
22	39
23	45
24	45
25	47
26	57
27	58
28	61
29	63
30	69
31	67
32	77
33	79
34	77
35	81
36	93
37	99
38	99
39	105
40	105
41	105
42	117
43	123
44	126
45	125
46	125
47	135
48	129
49	147
50	145
51	151
52	159
53	165
54	165
55	167
56	177
57	171
58	189
59	189
60	195