A205013 - cp's OEIS frontend

A205013 The number s(j)=C(2j-2,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	1
2	2
3	2
4	2
5	1
6	2
7	6
8	6
9	2
10	20
11	924
12	252
13	70
14	6
15	252
16	6
17	2
18	2
19	1
20	252
21	252
22	924
23	1
24	252
25	20
26	70
27	6
28	252
29	20
30	252
31	184756
32	6
33	924
34	2
35	2
36	20
37	2
38	924
39	3432
40	70
41	6
42	252
43	40116600
44	924
45	20
46	20
47	1
48	252
49	2
50	20
51	6
52	3432
53	252
54	6
55	12870
56	252
57	924
58	20
59	2333606220
60	252

[1, 2, 2, 2, 1, 2, 6, 6, 2, 20, 924, 252, 70, 6, 252, 6, 2, 2, 1, 252, 252, 924, 1, 252, 20, 70, 6, 252, 20, 252, 184756, 6, 924, 2, 2, 20, 2, 924, 3432, 70, 6, 252, 40116600, 924, 20, 20, 1, 252, 2, 20, 6, 3432, 252, 6, 12870, 252, 924, 20, 2333606220, 252]

cp's OEIS Frontend

A205013 The number s(j)=C(2j-2,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