A321686 - cp's OEIS frontend

A321686 Triangle read by rows: T(n,k) is the sum of the number of the arrangements of p_1 1's, p_2 2's, ..., p_k k's (p_1 + p_2 + ... + p_k = n and p_1 >= p_2 >= ... >= p_k) avoiding equal consecutive terms, where 1 <= k <= n.

n	a(n)
1	1
2	0
3	2
4	0
5	1
6	6
7	0
8	2
9	6
10	24
11	0
12	1
13	14
14	36
15	120
16	0
17	2
18	40
19	108
20	240
21	720
22	0
23	1
24	59
25	348
26	900
27	1800
28	5040
29	0
30	2
31	112
32	1486
33	3300
34	8160
35	15120
36	40320
37	0
38	1
39	287
40	3056
41	15744
42	33960
43	80640
44	141120
45	362880
46	0
47	2
48	448
49	10012
50	76776
51	180000
52	378000
53	866880
54	1451520
55	3628800

[1, 0, 2, 0, 1, 6, 0, 2, 6, 24, 0, 1, 14, 36, 120, 0, 2, 40, 108, 240, 720, 0, 1, 59, 348, 900, 1800, 5040, 0, 2, 112, 1486, 3300, 8160, 15120, 40320, 0, 1, 287, 3056, 15744, 33960, 80640, 141120, 362880, 0, 2, 448, 10012, 76776, 180000, 378000, 866880, 1451520, 3628800]

cp's OEIS Frontend

A321686 Triangle read by rows: T(n,k) is the sum of the number of the arrangements of p_1 1's, p_2 2's, ..., p_k k's (p_1 + p_2 + ... + p_k = n and p_1 >= p_2 >= ... >= p_k) avoiding equal consecutive terms, where 1 <= k <= n.

Table of values

List of values