Number of distinct degree sequences among all connected simple graphs with n vertices whose degrees are consecutive integers.
A382665
Number of distinct degree sequences among all connected simple graphs with n vertices whose degrees are consecutive integers.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =5a(5) =14a(6) =35a(7) =88a(8) =212a(9) =492a(10) =1122a(11) =2517a(12) =5571a(13) =12202a(14) =26507a(15) =57184a(16) =122666a(17) =261862a(18) =556686a(19) =1179166a(20) =2489747
External references
- oeis: A382665