A136630 - cp's OEIS frontend

A136630 Triangular array: T(n,k) counts the partitions of the set [n] into k odd sized blocks.

n	a(n)
0	1
1	0
2	1
3	0
4	0
5	1
6	0
7	1
8	0
9	1
10	0
11	0
12	4
13	0
14	1
15	0
16	1
17	0
18	10
19	0
20	1
21	0
22	0
23	16
24	0
25	20
26	0
27	1
28	0
29	1
30	0
31	91
32	0
33	35
34	0
35	1
36	0
37	0
38	64
39	0
40	336
41	0
42	56
43	0
44	1
45	0
46	1
47	0
48	820
49	0
50	966
51	0
52	84
53	0
54	1
55	0
56	0
57	256
58	0
59	5440
60	0
61	2352
62	0
63	120
64	0
65	1
66	0
67	1
68	0
69	7381
70	0
71	24970
72	0
73	5082
74	0
75	165
76	0
77	1
78	0
79	0
80	1024
81	0
82	87296
83	0

[1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 4, 0, 1, 0, 1, 0, 10, 0, 1, 0, 0, 16, 0, 20, 0, 1, 0, 1, 0, 91, 0, 35, 0, 1, 0, 0, 64, 0, 336, 0, 56, 0, 1, 0, 1, 0, 820, 0, 966, 0, 84, 0, 1, 0, 0, 256, 0, 5440, 0, 2352, 0, 120, 0, 1, 0, 1, 0, 7381, 0, 24970, 0, 5082, 0, 165, 0, 1, 0, 0, 1024, 0, 87296, 0]

cp's OEIS Frontend

A136630 Triangular array: T(n,k) counts the partitions of the set [n] into k odd sized blocks.

Table of values

List of values