login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136285
Number of graphs on n labeled nodes with maximal degree exactly 3.
3
0, 0, 0, 23, 515, 10210, 221130, 5499165, 158416629, 5264924490, 200122583760, 8616774658305, 416417619554365, 22400104990385122, 1331442091500919580, 86886850043131597095, 6189883012226095338135, 478992622411196645778030
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
REFERENCES
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..200
FORMULA
Equals A136282 - A136281.
CROSSREFS
Cf. A000085 (degree at most 1), A136281-A136286.
Sequence in context: A170704 A170742 A218725 * A114926 A118338 A171328
Adjacent sequences: A136282 A136283 A136284 * A136286 A136287 A136288
KEYWORD
nonn
AUTHOR
Don Knuth, Mar 31 2008
EXTENSIONS
More terms from Alois P. Heinz, Sep 12 2008
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 27 23:20 EST 2024. Contains 378181 sequences.
License Agreements, Terms of Use, Privacy Policy