Square array A(m,k) is the number of unicyclic graphs with m trees of k nodes; m,k >= 0, read by falling antidiagonals.
A338859
Square array A(m,k) is the number of unicyclic graphs with m trees of k nodes; m,k >= 0, read by falling antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =1a(8) =1a(9) =0a(10) =1a(11) =2a(12) =1a(13) =1a(14) =0a(15) =1a(16) =4a(17) =3a(18) =1a(19) =1a(20) =0a(21) =1a(22) =9a(23) =10a(24) =4a(25) =1a(26) =1a(27) =0a(28) =1a(29) =20
External references
- oeis: A338859