The OEIS is supported by the many generous donors to the OEIS Foundation.


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A142859 Number of fully gated graphs on n nodes. 3

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 03:21 EDT 2023. Contains 363103 sequences. (Running on oeis4.)