Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007085
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007085 Number of trivalent 3-connected bipartite planar graphs with 4n nodes.
(Formerly M2224)
+0
1
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 3, 1, 5, 4, 11, 20, 46 (list; graph; listen)
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.

CROSSREFS

Sequence in context: A010847 A082129 A096374 this_sequence A094648 A096975 A135184

Adjacent sequences: A007082 A007083 A007084 this_sequence A007086 A007087 A007088

KEYWORD

nonn

AUTHOR

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

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research