Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049365 Number of connected planar graphs with n nodes and even degrees (i.e. that are Eulerian). +0
1
1, 0, 1, 1, 3, 7, 21, 81, 401, 2499, 18604 (list; graph; listen)
OFFSET

1,5
CROSSREFS

Sequence in context: A001576 A075211 A075212 this_sequence A031885 A128599 A080882

Adjacent sequences: A049362 A049363 A049364 this_sequence A049366 A049367 A049368

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 September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.