Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007083
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007083 Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes.
(Formerly M0372)
+0
19
0, 0, 1, 0, 1, 1, 2, 2, 8, 8, 32, 57, 185, 466, 1543, 4583, 15374, 50116, 171168 (list; graph; listen)
OFFSET

2,7

COMMENT

Also the number of species of spherical latin bi-trades of size n. - Ian Wanless, Oct 08 2007

REFERENCES

N. Cavenagh and P. Lisonek, Planar Eulerian triangulations are equivalent to spherical latin bitrades, J. Combin. Theory, Series A, to appear, 2007.

D. A. Holton et al., Hamiltonian cycles in cubic 3-connected bipartite planar graphs, J. Combin. Theory, B 38 (1985), 279-297.

Sciriha, I. and Fowler, P.W., Nonbonding Orbitals in Fullerenes: Nuts and Cores in Singular Polyhedral Graphs J. Chem. Inf. Model., 47, 5, 1763 - 1775, 2007.

I. M. Wanless, A computer enumeration of small latin trades, Australas. J. Combin. 39, (2007) 247-258.

CROSSREFS

Sequence in context: A099328 A073090 A120544 this_sequence A016119 A037223 A066988

Adjacent sequences: A007080 A007081 A007082 this_sequence A007084 A007085 A007086

KEYWORD

nonn

AUTHOR

njas, Mira Bernstein (mira(AT)math.berkeley.edu)

EXTENSIONS

Description and initial terms corrected by Gordon Royle (gordon(AT)cs.uwa.edu.au) Feb 15 1999.

page 1

Search completed in 0.006 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