%I #6 May 31 2018 05:11:24
%N Number of fully gated graphs on n nodes.
%C a(n) = A142860(n) + A142861(n) (except there seems to be a typo in the published numbers).
%H C. J. Colbourn and C. Huybrechts, <a href="https://doi.org/10.1016/j.disc.2007.09.039">Fully gated graphs,: recognition and convex operations</a>, Discrete Math., 308 (2008), 5184-5195. [There is a typo in the published version of a(13)]
%Y Cf. A142860, A142861.
%A _N. J. A. Sloane_, Oct 01 2008
%E a(13) corrected by C. J. Colbourn, Oct 03 2008