%I #7 Aug 08 2015 23:47:43

%S 0,0,0,23,515,10210,221130,5499165,158416629,5264924490,200122583760,

%T 8616774658305,416417619554365,22400104990385122,1331442091500919580,

%U 86886850043131597095,6189883012226095338135,478992622411196645778030

%N Number of graphs on n labeled nodes with maximal degree exactly 3.

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

%H Alois P. Heinz, <a href="/A136285/b136285.txt">Table of n, a(n) for n = 1..200</a>

%F Equals A136282 - A136281.

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

%K nonn

%O 1,4

%A _Don Knuth_, Mar 31 2008

%E More terms from _Alois P. Heinz_, Sep 12 2008