Number of distinct sorted degree sequences among all n-vertex half-loop-graphs without isolated vertices.
A339843
Number of distinct sorted degree sequences among all n-vertex half-loop-graphs without isolated vertices.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =9a(4) =29a(5) =97a(6) =336a(7) =1188a(8) =4275a(9) =15579a(10) =57358a(11) =212908a(12) =795657a(13) =2990221a(14) =11291665a(15) =42814783a(16) =162920417a(17) =621885767a(18) =2380348729
External references
- oeis: A339843