|
Search: id:A142859
|
|
|
| A142859 |
|
Number of fully gated graphs on n nodes. |
|
+0
4
|
| |
|
|
OFFSET
|
5,2
|
|
|
COMMENT
|
a(n) = A142860(n) + A142861(n) (except there seems to be a typo in the published numbers).
|
|
REFERENCES
|
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
|
Cf. A142860, A142861.
Sequence in context: A050881 A122113 A093815 this_sequence A056221 A046849 A090530
Adjacent sequences: A142856 A142857 A142858 this_sequence A142860 A142861 A142862
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 01 2008
|
|
EXTENSIONS
|
a(13) corrected by C. J. Colbourn, Oct 03 2008
|
|
|
Search completed in 0.002 seconds
|
