The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Aug 25 2017 23:38:20
%S 0,0,0,0,256,15381,815867,47818683,3291232419,270038320842,
%T 26366544332292,3038643940889754,409107090075310746,
%U 63681176297547793493,11350054578585382645977,2296208875599834678215827,523217007018082627351544259,133356820608541419593405364486
%N Number of graphs on n labeled nodes with maximal degree exactly 4.
%D D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
%F Equals A136283 - A136282.
%Y Cf. A000085 (degree at most 1), A136281-A136285.
%K nonn
%O 1,5
%A _Don Knuth_, Mar 31 2008
%E a(13)-a(18) from _Andrew Howroyd_, Aug 25 2017