Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.
A360693
Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =2a(6) =3a(7) =10a(8) =15a(9) =15a(10) =10a(11) =3a(12) =4a(13) =37a(14) =108a(15) =228a(16) =336a(17) =394a(18) =336a(19) =228a(20) =108a(21) =37a(22) =4a(23) =5a(24) =101a(25) =600a(26) =2150a(27) =5645a(28) =11680a(29) =19752
External references
- oeis: A360693