A330964 - cp's OEIS frontend

A330964 Array read by antidiagonals: A(n,k) is the number of sets of nonempty subsets of a k-element set where each element appears in at most n subsets.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	2
9	1
10	1
11	15
12	8
13	2
14	1
15	1
16	52
17	59
18	8
19	2
20	1
21	1
22	203
23	652
24	109
25	8
26	2
27	1
28	1
29	877
30	9736
31	3623
32	128
33	8
34	2
35	1
36	1
37	4140
38	186478
39	200522
40	11087
41	128
42	8
43	2
44	1
45	1
46	21147
47	4421018
48	16514461
49	2232875
50	21380
51	128
52	8
53	2
54	1
55	1
56	115975
57	126317785
58	1912959395
59	775098224
60	15312665
61	29228
62	128
63	8
64	2
65	1

[1, 1, 1, 1, 2, 1, 1, 5, 2, 1, 1, 15, 8, 2, 1, 1, 52, 59, 8, 2, 1, 1, 203, 652, 109, 8, 2, 1, 1, 877, 9736, 3623, 128, 8, 2, 1, 1, 4140, 186478, 200522, 11087, 128, 8, 2, 1, 1, 21147, 4421018, 16514461, 2232875, 21380, 128, 8, 2, 1, 1, 115975, 126317785, 1912959395, 775098224, 15312665, 29228, 128, 8, 2, 1]

cp's OEIS Frontend

A330964 Array read by antidiagonals: A(n,k) is the number of sets of nonempty subsets of a k-element set where each element appears in at most n subsets.

Table of values

List of values