A243333 - 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

A243333

Number of simple connected graphs with n nodes that are integral and K_4 free.

0

1, 1, 1, 1, 2, 5, 5, 9, 15, 38

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

OFFSET

1,5

COMMENTS

K_4 is the complete graph on four vertices.

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

CROSSREFS

Cf. A064731 (integral graphs), A079574 (K_4 free graphs).

Sequence in context: A070243 A367642 A050175 * A059797 A173567 A288726

Adjacent sequences: A243330 A243331 A243332 * A243334 A243335 A243336

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 03 2014

STATUS

approved