A239894 - cp's OEIS frontend

A239894 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 slices.

n	a(n)
1	1
2	1
3	1
4	4
5	2
6	1
7	25
8	9
9	3
10	1
11	217
12	58
13	15
14	4
15	1
16	2470
17	500
18	100
19	22
20	5
21	1
22	35647
23	5574
24	861
25	152
26	30
27	6
28	1
29	637129
30	78595
31	9435
32	1313
33	215
34	39
35	7
36	1
37	13843948
38	1376162
39	130159
40	14192
41	1870
42	290
43	49
44	8
45	1
46	360022957
47	29417919
48	2232792
49	191850
50	20001
51	2547
52	378
53	60
54	9
55	1

[1, 1, 1, 4, 2, 1, 25, 9, 3, 1, 217, 58, 15, 4, 1, 2470, 500, 100, 22, 5, 1, 35647, 5574, 861, 152, 30, 6, 1, 637129, 78595, 9435, 1313, 215, 39, 7, 1, 13843948, 1376162, 130159, 14192, 1870, 290, 49, 8, 1, 360022957, 29417919, 2232792, 191850, 20001, 2547, 378, 60, 9, 1]

cp's OEIS Frontend

A239894 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 slices.

Table of values

List of values