login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049366 Number of Hamiltonian planar graphs with n nodes. 0
0, 0, 1, 3, 7, 36, 221, 2184, 26985, 395877, 6362861 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

CROSSREFS

Sequence in context: A221511 A102917 A156465 * A081010 A100377 A270396

Adjacent sequences:  A049363 A049364 A049365 * A049367 A049368 A049369

KEYWORD

nonn,nice,hard

AUTHOR

Brendan McKay

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 01:57 EST 2019. Contains 329948 sequences. (Running on oeis4.)