A259051 - cp's OEIS frontend

A259051 Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.

n	a(n)
1	1
2	1
3	4
4	1
5	18
6	27
7	1
8	68
9	288
10	256
11	1
12	250
13	2250
14	5000
15	3125
16	1
17	922
18	15795
19	65880
20	97200
21	46656
22	1
23	3430
24	105987
25	739508
26	1932805
27	2117682
28	823543
29	1
30	12868
31	696864
32	7653632
33	31539200
34	59179008
35	51380224
36	16777216
37	1
38	48618
39	4540968
40	75687696
41	461828790
42	1320099444
43	1919564892
44	1377495072
45	387420489

[1, 1, 4, 1, 18, 27, 1, 68, 288, 256, 1, 250, 2250, 5000, 3125, 1, 922, 15795, 65880, 97200, 46656, 1, 3430, 105987, 739508, 1932805, 2117682, 823543, 1, 12868, 696864, 7653632, 31539200, 59179008, 51380224, 16777216, 1, 48618, 4540968, 75687696, 461828790, 1320099444, 1919564892, 1377495072, 387420489]

cp's OEIS Frontend

A259051 Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.

Table of values

List of values