Triangular array read by rows. T(n,k) is the number of binary relations on [n] containing exactly k strongly connected components, n >= 0, 0 <= k <= n.

A361269

Triangular array read by rows. T(n,k) is the number of binary relations on [n] containing exactly k strongly connected components, n >= 0, 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =2a(3) =0a(4) =4a(5) =12a(6) =0a(7) =144a(8) =168a(9) =200a(10) =0a(11) =25696a(12) =18768a(13) =12384a(14) =8688a(15) =0a(16) =18082560a(17) =8697280a(18) =3923040a(19) =1914560a(20) =936992a(21) =0a(22) =47025585664a(23) =14670384000a(24) =4512045120a(25) =1622358720a(26) =647087040a(27) =242016192a(28) =0a(34) =482302375296

External references