Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A021103
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A021103 Two-connected (or biconnected) planar graphs with n nodes. +0
6
0, 0, 1, 3, 9, 44, 294, 2893, 36496, 545808, 9029737 (list; graph; listen)
OFFSET

1,4

REFERENCES

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

CROSSREFS

Cf. A005142, A049336.

Adjacent sequences: A021100 A021101 A021102 this_sequence A021104 A021105 A021106

Sequence in context: A108239 A028858 A058106 this_sequence A001902 A068100 A012821

KEYWORD

nonn

AUTHOR

Brendan McKay (bdm(AT)cs.anu.edu.au)

page 1

Search completed in 0.003 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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research