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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 May 31 2018 05:11:24
%S 1,4,6,28,80,409,2010,13314,99393,919304
%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.
%K nonn,more
%O 5,2
%A _N. J. A. Sloane_, Oct 01 2008
%E a(13) corrected by C. J. Colbourn, Oct 03 2008