A192990 - cp's OEIS frontend

A192990 Pyramid P(n, t, d) read by planes and rows, for 0 <= t+d <= n: number of ways n triples can sit in a row so that exactly t triples are together and exactly d triples are separated into a couple and a loner.

n	a(n)
0	1
1	0
2	0
3	6
4	72
5	144
6	288
7	0
8	144
9	72
10	37584
11	95904
12	98496
13	51840
14	11664
15	25920
16	31104
17	1296
18	7776
19	1296
20	53529984
21	127899648
22	130761216
23	69921792
24	17915904
25	11321856
26	26002944
27	23887872
28	10202112
29	1430784
30	2985984
31	2612736
32	124416
33	373248
34	31104

[1, 0, 0, 6, 72, 144, 288, 0, 144, 72, 37584, 95904, 98496, 51840, 11664, 25920, 31104, 1296, 7776, 1296, 53529984, 127899648, 130761216, 69921792, 17915904, 11321856, 26002944, 23887872, 10202112, 1430784, 2985984, 2612736, 124416, 373248, 31104]

cp's OEIS Frontend

A192990 Pyramid P(n, t, d) read by planes and rows, for 0 <= t+d <= n: number of ways n triples can sit in a row so that exactly t triples are together and exactly d triples are separated into a couple and a loner.

Table of values

List of values