login

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”).

A142859
Number of fully gated graphs on n nodes.
3
1, 4, 6, 28, 80, 409, 2010, 13314, 99393, 919304
OFFSET
5,2
COMMENTS
a(n) = A142860(n) + A142861(n) (except there seems to be a typo in the published numbers).
LINKS
C. J. Colbourn and C. Huybrechts, Fully gated graphs,: recognition and convex operations, Discrete Math., 308 (2008), 5184-5195. [There is a typo in the published version of a(13)]
CROSSREFS
Sequence in context: A229719 A122113 A093815 * A259087 A364737 A056221
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Oct 01 2008
EXTENSIONS
a(13) corrected by C. J. Colbourn, Oct 03 2008
STATUS
approved