A239895 - cp's OEIS frontend

A239895 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k components.

n	a(n)
1	1
2	1
3	1
4	3
5	3
6	1
7	16
8	15
9	6
10	1
11	129
12	110
13	45
14	10
15	1
16	1438
17	1104
18	435
19	105
20	15
21	1
22	20955
23	14455
24	5334
25	1295
26	210
27	21
28	1
29	384226
30	238536
31	81256
32	19089
33	3220
34	378
35	28
36	1
37	8623101
38	4834854
39	1509246
40	335496
41	56259
42	7056
43	630
44	36
45	1

[1, 1, 1, 3, 3, 1, 16, 15, 6, 1, 129, 110, 45, 10, 1, 1438, 1104, 435, 105, 15, 1, 20955, 14455, 5334, 1295, 210, 21, 1, 384226, 238536, 81256, 19089, 3220, 378, 28, 1, 8623101, 4834854, 1509246, 335496, 56259, 7056, 630, 36, 1]

cp's OEIS Frontend

A239895 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k components.

Table of values

List of values