Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119501
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119501 Number of isomorphism classes of 3-connected simple planar graphs (convex polytopes) where isomorphism does not allow reflection. +0
1
0, 0, 0, 1, 2, 8, 45, 419, 4798, 62754, 872411, 12728018, 192324654, 2991463239, 47663036427, 775158142233, 12831576165782 (list; graph; listen)
OFFSET

1,5

COMMENT

If reflection is allowed, the counts are A000944.

LINKS

G. Brinkmannm and B. McKay, Program for generating these objects

CROSSREFS

Cf. A005470.

Sequence in context: A009345 A084553 A003091 this_sequence A006664 A141117 A005840

Adjacent sequences: A119498 A119499 A119500 this_sequence A119502 A119503 A119504

KEYWORD

hard,nonn

AUTHOR

Brendan McKay (bdm(AT)cs.anu.edu.au), Jun 02 2006

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research