A142861 -id:A142861 - cp's OEIS frontend

Showing 1-2 of 2 results.

A142859 Number of fully gated graphs on n nodes.

Original entry on oeis.org

1, 4, 6, 28, 80, 409, 2010, 13314, 99393, 919304

Offset: 5

N. J. A. Sloane, Oct 01 2008

a(n) = A142860(n) + A142861(n) (except there seems to be a typo in the published numbers).

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)]

Cf. A142860, A142861.

a(13) corrected by C. J. Colbourn, Oct 03 2008

A142860 Number of trivially fully gated graphs on n nodes.

Original entry on oeis.org

1, 3, 4, 13, 26, 94, 295, 1452, 8270, 72281

Offset: 5

N. J. A. Sloane, Oct 01 2008

C. J. Colbourn and C. Huybrechts, Fully gated graphs,: recognition and convex operations, Discrete Math., 308 (2008), 5184-5195.

Cf. A142859, A142861.

Showing 1-2 of 2 results.