A131103 - cp's OEIS frontend

A131103 Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there are no boxes with exactly one object (n, k >= 1).

n	a(n)
1	0
2	0
3	1
4	0
5	2
6	1
7	0
8	3
9	2
10	1
11	0
12	4
13	3
14	8
15	1
16	0
17	5
18	4
19	21
20	22
21	1
22	0
23	6
24	5
25	40
26	63
27	52
28	1
29	0
30	7
31	6
32	65
33	124
34	243
35	114
36	1
37	0
38	8
39	7
40	96
41	205
42	664
43	969
44	240
45	1
46	0
47	9
48	8
49	133
50	306
51	1405
52	3196
53	3657
54	494
55	1
56	0
57	10
58	9
59	176
60	427
61	2556
62	7425
63	15712
64	12987
65	1004
66	1
67	0
68	11
69	10
70	225
71	568
72	4207

[0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 8, 1, 0, 5, 4, 21, 22, 1, 0, 6, 5, 40, 63, 52, 1, 0, 7, 6, 65, 124, 243, 114, 1, 0, 8, 7, 96, 205, 664, 969, 240, 1, 0, 9, 8, 133, 306, 1405, 3196, 3657, 494, 1, 0, 10, 9, 176, 427, 2556, 7425, 15712, 12987, 1004, 1, 0, 11, 10, 225, 568, 4207]

cp's OEIS Frontend

A131103 Rectangular array read by antidiagonals: a(n, k) is the number of ways to put k labeled objects into n labeled boxes so that there are no boxes with exactly one object (n, k >= 1).

Table of values

List of values