Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).
A381467
Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =3a(8) =5a(9) =6a(10) =13a(11) =1a(12) =11a(13) =33a(14) =4a(15) =23a(16) =89a(17) =21a(18) =47a(19) =240a(20) =85a(21) =2a(22) =106a(23) =657a(24) =345a(25) =16a(26) =235a(27) =1806a(28) =1289a(29) =109
External references
- oeis: A381467