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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =2a(5) =1a(6) =25a(7) =9a(8) =3a(9) =1a(10) =217a(11) =58a(12) =15a(13) =4a(14) =1a(15) =2470a(16) =500a(17) =100a(18) =22a(19) =5a(20) =1a(21) =35647a(22) =5574a(23) =861a(24) =152a(25) =30a(26) =6a(27) =1a(28) =637129a(29) =78595
External references
- oeis: A239894