Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).
A070166
Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =1a(7) =1a(8) =2a(9) =4a(10) =6a(11) =4a(12) =2a(13) =1a(14) =1a(15) =2a(16) =5a(17) =11a(18) =17a(19) =18a(20) =17a(21) =11a(22) =5a(23) =2a(24) =1a(25) =1a(26) =2a(27) =5a(28) =13a(29) =29
External references
- oeis: A070166