Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n.
A304222
Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =0a(4) =0a(5) =1a(6) =1a(7) =0a(8) =1a(9) =0a(10) =3a(11) =1a(12) =1a(13) =1a(14) =0a(15) =11a(16) =5a(17) =3a(18) =1a(19) =1a(20) =0a(21) =61a(22) =29a(23) =14a(24) =5a(25) =2a(26) =1a(27) =0a(28) =507a(29) =224
External references
- oeis: A304222