Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose smallest connected component has exactly k nodes; n >= 1, 1 <= k <= n.
A348071
Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose smallest connected component has exactly k nodes; n >= 1, 1 <= k <= n.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =0a(9) =3a(10) =0a(11) =0a(12) =0a(13) =0a(14) =12a(15) =0a(16) =0a(17) =10a(18) =0a(19) =0a(20) =60a(21) =0a(22) =0a(23) =105a(24) =0a(25) =0a(26) =0a(27) =360a(28) =0a(29) =0
External references
- oeis: A348071