Pascal-like triangle read by rows. Number of nonterminal symbols (which generate strings of length k) in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.
A090349
Pascal-like triangle read by rows. Number of nonterminal symbols (which generate strings of length k) in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =3a(5) =1a(6) =4a(7) =6a(8) =0a(9) =1a(10) =5a(11) =10a(12) =10a(13) =0a(14) =1a(15) =6a(16) =15a(17) =20a(18) =0a(19) =0a(20) =1a(21) =7a(22) =21a(23) =35a(24) =35a(25) =0a(26) =0a(27) =1a(28) =8a(29) =28
External references
- oeis: A090349