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 unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R2 and R4.
(Formerly M3255)
1
0, 0, 0, 0, 1, 1, 1, 4, 5, 14, 28, 86, 211, 648, 1878, 5931, 18326, 58746, 187620, 608065, 1975191, 6461809, 21212414 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,8

COMMENTS

The graphs R2 and R4 are given on p. 281 of Holton. - Sean A. Irvine, Oct 09 2017

REFERENCES

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

LINKS

Table of n, a(n) for n=2..24.

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

CROSSREFS

Cf. A007083.

Sequence in context: A200177 A241863 A316415 * A216243 A093862 A041375

Adjacent sequences:  A007081 A007082 A007083 * A007085 A007086 A007087

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Mira Bernstein

EXTENSIONS

Title improved, a(17) corrected and a(20)-a(24) from Sean A. Irvine, Oct 09 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 04:18 EST 2019. Contains 320371 sequences. (Running on oeis4.)