A243785 - OEIS

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

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

Other ways to Give

A243785

Number of graphs with n nodes that are chordal but not integral.

1

0, 0, 1, 4, 12, 56, 267, 1605, 11909, 109525

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

FORMULA

a(n) = A048192(n) - A243786(n).

CROSSREFS

Cf. A048192 (chordal graphs), A241842 (non-integral graphs).

Sequence in context: A295496 A164575 A124004 * A019266 A009114 A144012

Adjacent sequences: A243782 A243783 A243784 * A243786 A243787 A243788

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 27 2014

STATUS

approved