Triangle read by rows: T(n,k) is the number of unlabeled simple connected graphs with n vertices and treedepth k.
A387431
Triangle read by rows: T(n,k) is the number of unlabeled simple connected graphs with n vertices and treedepth k.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =4a(9) =1a(10) =0a(11) =1a(12) =10a(13) =9a(14) =1a(15) =0a(16) =1a(17) =25a(18) =64a(19) =21a(20) =1a(21) =0a(22) =1a(23) =62a(24) =380a(25) =363a(26) =46a(27) =1a(28) =0a(29) =1
External references
- oeis: A387431