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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =3a(5) =1a(6) =16a(7) =15a(8) =6a(9) =1a(10) =129a(11) =110a(12) =45a(13) =10a(14) =1a(15) =1438a(16) =1104a(17) =435a(18) =105a(19) =15a(20) =1a(21) =20955a(22) =14455a(23) =5334a(24) =1295a(25) =210a(26) =21a(27) =1a(28) =384226a(29) =238536
External references
- oeis: A239895