Mutual solutions to two classification counting problems: binary block codes of wordlength J with N used words; and classifications of N elements by J partitions.
A171876
Mutual solutions to two classification counting problems: binary block codes of wordlength J with N used words; and classifications of N elements by J partitions.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =3a(6) =3a(7) =1a(8) =1a(9) =4a(10) =6a(11) =19a(12) =27a(13) =50a(14) =56a(15) =1a(16) =1a(17) =5a(18) =10a(19) =47a(20) =131a(21) =472a(22) =1326a(23) =3779a(24) =9013a(25) =19963a(26) =38073a(27) =65664a(28) =98804a(29) =133576
External references
- oeis: A171876