Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.
A217763
Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.
Terms
- a(0) =1a(1) =3a(2) =12a(3) =12a(4) =90a(5) =120a(6) =70a(7) =600a(8) =1800a(9) =1200a(10) =465a(11) =4725a(12) =19530a(13) =31500a(14) =12600a(15) =3507a(16) =42168a(17) =211680a(18) =529200a(19) =529200a(20) =141120a(21) =30016a(22) =414288a(23) =2451456a(24) =7902720a(25) =13124160a(26) =8890560a(27) =1693440a(28) =286884a(29) =4460760
External references
- oeis: A217763