Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049366
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049366 Number of Hamiltonian planar graphs with n nodes. +0
1
0, 0, 1, 3, 7, 36, 221, 2184, 26985, 395877, 6362861 (list; graph; listen)
OFFSET

1,4

CROSSREFS

Sequence in context: A047158 A102917 A156465 this_sequence A081010 A100377 A167169

Adjacent sequences: A049363 A049364 A049365 this_sequence A049367 A049368 A049369

KEYWORD

nonn,nice,hard

AUTHOR

Brendan McKay (bdm(AT)cs.anu.edu.au)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research