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

A243274

Number of graphs with n nodes that are Hamiltonian and non-integral.

0

1, 0, 1, 2, 1, 5, 4, 11, 12, 50

(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

CROSSREFS

Cf. A003216 (Hamiltonian graphs), A064731 (integral graphs), A241842 (non-integral graphs).

Sequence in context: A144240 A233525 A209143 * A119914 A152192 A290889

Adjacent sequences: A243271 A243272 A243273 * A243275 A243276 A243277

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 02 2014

STATUS

approved