Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000287
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000287 Number of rooted polyhedral graphs with n edges.
(Formerly M3290 N1326)
+0
2
1, 0, 4, 6, 24, 66, 214, 676, 2209, 7296, 24460, 82926, 284068, 981882, 3421318, 12007554, 42416488, 150718770, 538421590, 1932856590, 6969847486 (list; graph; listen)
page 1

Search completed in 0.001 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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research