A144502 - cp's OEIS frontend

A144502 Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.

n	a(n)
0	1
1	1
2	1
3	2
4	2
5	1
6	7
7	7
8	5
9	1
10	37
11	37
12	30
13	16
14	1
15	266
16	266
17	229
18	155
19	65
20	1
21	2431
22	2431
23	2165
24	1633
25	946
26	326
27	1
28	27007
29	27007
30	24576
31	19714
32	13219
33	6687
34	1957
35	1
36	353522
37	353522
38	326515
39	272501
40	198773
41	119917
42	53822
43	13700
44	1
45	5329837
46	5329837
47	4976315
48	4269271
49	3289726
50	2199722
51	1205857
52	486355
53	109601
54	1

[1, 1, 1, 2, 2, 1, 7, 7, 5, 1, 37, 37, 30, 16, 1, 266, 266, 229, 155, 65, 1, 2431, 2431, 2165, 1633, 946, 326, 1, 27007, 27007, 24576, 19714, 13219, 6687, 1957, 1, 353522, 353522, 326515, 272501, 198773, 119917, 53822, 13700, 1, 5329837, 5329837, 4976315, 4269271, 3289726, 2199722, 1205857, 486355, 109601, 1]

cp's OEIS Frontend

A144502 Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.

Table of values

List of values