Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006866 Number of irreducible polyhedral graphs with n nodes.
(Formerly M0897)
+0
1
1, 1, 2, 3, 9, 19, 71, 249, 1058, 4705, 22380 (list; graph; listen)
OFFSET

4,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.

CROSSREFS

Adjacent sequences: A006863 A006864 A006865 this_sequence A006867 A006868 A006869

Sequence in context: A094812 A079992 A106519 this_sequence A121908 A097075 A036673

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research