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