login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136286 Number of graphs on n labeled nodes with maximal degree exactly 4. 5
0, 0, 0, 0, 256, 15381, 815867, 47818683, 3291232419, 270038320842, 26366544332292, 3038643940889754, 409107090075310746, 63681176297547793493, 11350054578585382645977, 2296208875599834678215827, 523217007018082627351544259, 133356820608541419593405364486 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 02:32 EST 2021. Contains 349590 sequences. (Running on oeis4.)