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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007085 Number of trivalent 3-connected bipartite planar graphs with 4n nodes.
(Formerly M2224)
0
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 3, 1, 5, 4, 11, 20, 46 (list; graph; refs; listen; history; internal format)
OFFSET

2,12

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: A082129 A159970 A096374 * A094648 A096975 A145174

Adjacent sequences:  A007082 A007083 A007084 * A007086 A007087 A007088

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 17 20:48 EST 2012. Contains 206085 sequences.