A007721 Number of distinct degree sequences among all connected graphs with n nodes.
1, 1, 2, 6, 19, 68, 236, 863, 3137, 11636, 43306, 162728, 614142, 2330454, 8875656, 33924699, 130038017, 499753560, 1924912505, 7429159770, 28723877046, 111236422377, 431403469046, 1675316533812, 6513837677642, 25354842098354, 98794053266471, 385312558567775
Offset: 1
Links
- Wang Kai, Table of n, a(n) for n = 1..118
- N. Durand, G. Granger, A traffic complexity approach through cluster analysis, in proceedings of the 5th ATM R&D Seminar, Budapest, Hungary (2003)
- T. Hoppe, A. Petrone,Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
- F. Ruskey, Alley CATs in search of good homes, Congress. Numerant., 102 (1994) 97-110.
- Kai Wang, Efficient Counting of Degree Sequences, arXiv preprint arXiv:1604.04148 [math.CO], 2017.
- Index entries for sequences related to graphical partitions
Extensions
a(9) corrected by Gordon Royle, Aug 30 2006
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 19 2007
Prepended missing term a(1), Travis Hoppe, Aug 04 2014
a(22)-a(28) added by Wang Kai, Feb 15 2017
Comments