Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).

A058879

Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =3a(6) =1a(7) =1a(8) =4a(9) =7a(10) =1a(11) =1a(12) =4a(13) =9a(14) =18a(15) =1a(16) =1a(17) =5a(18) =10a(19) =28a(20) =44a(21) =1a(22) =1a(23) =5a(24) =13a(25) =32a(26) =71a(27) =117a(28) =1a(29) =1

External references