A258371 - cp's OEIS frontend

A258371 Triangle read by rows: T(n,k) is number of ways of arranging n indistinguishable points on an n X n square grid such that k rows contain at least one point.

n	a(n)
1	1
2	2
3	4
4	3
5	54
6	27
7	4
8	408
9	1152
10	256
11	5
12	2500
13	22500
14	25000
15	3125
16	6
17	13830
18	315900
19	988200
20	583200
21	46656
22	7
23	72030
24	3709545
25	25882780
26	40588905
27	14823774
28	823543
29	8
30	360304
31	39024384
32	535754240
33	1766195200
34	1657012224
35	411041792
36	16777216

[1, 2, 4, 3, 54, 27, 4, 408, 1152, 256, 5, 2500, 22500, 25000, 3125, 6, 13830, 315900, 988200, 583200, 46656, 7, 72030, 3709545, 25882780, 40588905, 14823774, 823543, 8, 360304, 39024384, 535754240, 1766195200, 1657012224, 411041792, 16777216]

cp's OEIS Frontend

A258371 Triangle read by rows: T(n,k) is number of ways of arranging n indistinguishable points on an n X n square grid such that k rows contain at least one point.

Table of values

List of values