A136286 Number of graphs on n labeled nodes with maximal degree exactly 4.

0, 0, 0, 0, 256, 15381, 815867, 47818683, 3291232419, 270038320842, 26366544332292, 3038643940889754, 409107090075310746, 63681176297547793493, 11350054578585382645977, 2296208875599834678215827, 523217007018082627351544259, 133356820608541419593405364486

Offset

1,5

References

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

Links

Table of n, a(n) for n=1..18.

Formula

Equals A136283 - A136282.

Crossrefs

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

Sequence in context: A240932 A238073 A017032 * A269204 A224283 A224206

Adjacent sequences: A136283 A136284 A136285 * A136287 A136288 A136289

Keyword

nonn

Author

Don Knuth, Mar 31 2008

Extensions

a(13)-a(18) from Andrew Howroyd, Aug 25 2017

Status

approved