A003105 - cp's OEIS frontend

A003105 Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	2
7	3
8	3
9	3
10	4
11	5
12	6
13	7
14	8
15	9
16	10
17	12
18	14
19	16
20	18
21	20
22	23
23	26
24	30
25	34
26	38
27	42
28	47
29	53
30	60
31	67
32	74
33	82
34	91
35	102
36	114
37	126
38	139
39	153
40	169
41	187
42	207
43	228
44	250
45	274
46	301
47	331
48	364
49	399
50	436
51	476
52	520
53	569
54	622
55	679
56	739
57	804
58	875
59	953
60	1038
61	1128
62	1224
63	1327

[1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 23, 26, 30, 34, 38, 42, 47, 53, 60, 67, 74, 82, 91, 102, 114, 126, 139, 153, 169, 187, 207, 228, 250, 274, 301, 331, 364, 399, 436, 476, 520, 569, 622, 679, 739, 804, 875, 953, 1038, 1128, 1224, 1327]

cp's OEIS Frontend

A003105 Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.

Table of values

List of values