login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007084 Number of trivalent 3-connected bipartite planar graphs with 4n nodes.
(Formerly M3255)
1
0, 0, 0, 0, 1, 1, 1, 4, 5, 14, 28, 86, 211, 648, 1878, 5941, 18326, 58746 (list; graph; refs; listen; history; internal format)
OFFSET

2,8

REFERENCES

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

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

CROSSREFS

Sequence in context: A191790 A006904 A200177 * A093862 A041375 A042279

Adjacent sequences:  A007081 A007082 A007083 * A007085 A007086 A007087

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein (mira(AT)math.berkeley.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:07 EST 2012. Contains 205930 sequences.