A131105 - cp's OEIS frontend

A131105 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 exactly two boxes with exactly one object (n, k >= 2).

n	a(n)
2	2
3	6
4	0
5	12
6	0
7	0
8	20
9	0
10	36
11	0
12	30
13	0
14	144
15	60
16	0
17	42
18	0
19	360
20	240
21	90
22	0
23	56
24	0
25	720
26	600
27	1440
28	126
29	0
30	72
31	0
32	1260
33	1200
34	6300
35	5544
36	168
37	0
38	90
39	0
40	2016
41	2100
42	18000
43	26460
44	17472
45	216
46	0
47	110
48	0
49	3024
50	3360
51	40950
52	78120
53	136080
54	49248
55	270
56	0
57	132
58	0
59	4320

[2, 6, 0, 12, 0, 0, 20, 0, 36, 0, 30, 0, 144, 60, 0, 42, 0, 360, 240, 90, 0, 56, 0, 720, 600, 1440, 126, 0, 72, 0, 1260, 1200, 6300, 5544, 168, 0, 90, 0, 2016, 2100, 18000, 26460, 17472, 216, 0, 110, 0, 3024, 3360, 40950, 78120, 136080, 49248, 270, 0, 132, 0, 4320]

cp's OEIS Frontend

A131105 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 exactly two boxes with exactly one object (n, k >= 2).

Table of values

List of values