Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).
A055633
Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =10a(6) =1a(7) =2a(8) =280a(9) =2a(10) =10a(11) =235200a(12) =4a(13) =20a(14) =280a(15) =173859840000a(16) =40a(17) =2800a(18) =235200a(20) =100a(21) =11200a(22) =65856000a(23) =173859840000a(25) =28000a(26) =1317120000
External references
- oeis: A055633