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

A049366

Number of Hamiltonian planar graphs with n nodes.

1

0, 0, 1, 3, 7, 36, 221, 2184, 26985, 395877, 6362861, 108791383

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

OFFSET

1,4

LINKS

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

Sean A. Irvine, Java program (github)

CROSSREFS

Sequence in context: A221511 A102917 A156465 * A081010 A100377 A270396

Adjacent sequences: A049363 A049364 A049365 * A049367 A049368 A049369

KEYWORD

nonn,nice,hard,more

AUTHOR

EXTENSIONS

a(12) from Sean A. Irvine, Aug 08 2021

STATUS

approved