A205030 - cp's OEIS frontend

A205030 The number s(j)=j*(j+1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists.

n	a(n)
1	2
2	2
3	6
4	2
5	2
6	6
7	6
8	12
9	2
10	2
11	20
12	6
13	30
14	6
15	12
16	56
17	56
18	2
19	72
20	2
21	30
22	20
23	110
24	6
25	6
26	30
27	2
28	2
29	182
30	12
31	210
32	240
33	6
34	56
35	2
36	6
37	306
38	72
39	12
40	2
41	380
42	30
43	420
44	12
45	20
46	110
47	506
48	42
49	12
50	6
51	30
52	20
53	650
54	2
55	72
56	20
57	42
58	182
59	812
60	12

[2, 2, 6, 2, 2, 6, 6, 12, 2, 2, 20, 6, 30, 6, 12, 56, 56, 2, 72, 2, 30, 20, 110, 6, 6, 30, 2, 2, 182, 12, 210, 240, 6, 56, 2, 6, 306, 72, 12, 2, 380, 30, 420, 12, 20, 110, 506, 42, 12, 6, 30, 20, 650, 2, 72, 20, 42, 182, 812, 12]

cp's OEIS Frontend

A205030 The number s(j)=j*(j+1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists.

Table of values

List of values

n	a(n)
1	2
2	2
3	6
4	2
5	2
6	6
7	6
8	12
9	2
10	2
11	20
12	6
13	30
14	6
15	12
16	56
17	56
18	2
19	72
20	2
21	30
22	20
23	110
24	6
25	6
26	30
27	2
28	2
29	182
30	12
31	210
32	240
33	6
34	56
35	2
36	6
37	306
38	72
39	12
40	2
41	380
42	30
43	420
44	12
45	20
46	110
47	506
48	42
49	12
50	6
51	30
52	20
53	650
54	2
55	72
56	20
57	42
58	182
59	812
60	12

n	a(n)
1	2
2	2
3	6
4	2
5	2
6	6
7	6
8	12
9	2
10	2
11	20
12	6
13	30
14	6
15	12
16	56
17	56
18	2
19	72
20	2
21	30
22	20
23	110
24	6
25	6
26	30
27	2
28	2
29	182
30	12
31	210
32	240
33	6
34	56
35	2
36	6
37	306
38	72
39	12
40	2
41	380
42	30
43	420
44	12
45	20
46	110
47	506
48	42
49	12
50	6
51	30
52	20
53	650
54	2
55	72
56	20
57	42
58	182
59	812
60	12

n	a(n)
1	2
2	2
3	6
4	2
5	2
6	6
7	6
8	12
9	2
10	2
11	20
12	6
13	30
14	6
15	12
16	56
17	56
18	2
19	72
20	2
21	30
22	20
23	110
24	6
25	6
26	30
27	2
28	2
29	182
30	12
31	210
32	240
33	6
34	56
35	2
36	6
37	306
38	72
39	12
40	2
41	380
42	30
43	420
44	12
45	20
46	110
47	506
48	42
49	12
50	6
51	30
52	20
53	650
54	2
55	72
56	20
57	42
58	182
59	812
60	12