login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136284 Number of graphs on n labeled nodes with maximal degree exactly 2. 0
0, 0, 4, 31, 227, 1782, 15564, 151455, 1635703, 19457998, 252962528, 3568119351, 54262590843, 884831668974, 15397747311556, 284767367151241, 5576696534340377, 115269731259650802, 2507575460681918232 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.

FORMULA

Equals A136281 - A000085.

CROSSREFS

Cf. A000085 (degree at most 1), A136281-A136286.

Sequence in context: A005216 A124033 A014537 * A183911 A039765 A001091

Adjacent sequences:  A136281 A136282 A136283 * A136285 A136286 A136287

KEYWORD

nonn

AUTHOR

D. E. Knuth, Mar 31 2008

EXTENSIONS

More terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 12 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 13:12 EST 2012. Contains 205909 sequences.