Triangular array read by rows: T(n,k) is the number of functional digraphs on {1,2,...,n} such that every element is mapped to a recurrent element and there are exactly k cycles, n>=1, 1<=k<=n.
A228534
Triangular array read by rows: T(n,k) is the number of functional digraphs on {1,2,...,n} such that every element is mapped to a recurrent element and there are exactly k cycles, n>=1, 1<=k<=n.
Terms
- a(0) =1a(1) =3a(2) =1a(3) =11a(4) =9a(5) =1a(6) =58a(7) =71a(8) =18a(9) =1a(10) =409a(11) =620a(12) =245a(13) =30a(14) =1a(15) =3606a(16) =6274a(17) =3255a(18) =625a(19) =45a(20) =1a(21) =38149a(22) =73339a(23) =45724a(24) =11795a(25) =1330a(26) =63a(27) =1a(28) =470856a(29) =977780
External references
- oeis: A228534