Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with degeneracy k, 0 <= k < n.
A384849
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with degeneracy k, 0 <= k < n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =5a(8) =4a(9) =1a(10) =1a(11) =9a(12) =18a(13) =5a(14) =1a(15) =1a(16) =19a(17) =85a(18) =43a(19) =7a(20) =1a(21) =1a(22) =36a(23) =471a(24) =442a(25) =85a(26) =8a(27) =1a(28) =1a(29) =75
External references
- oeis: A384849