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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033700 Number of connected transitive 4-valent (or quartic) graphs with n nodes. 0
1, 1, 1, 3, 3, 3, 2, 10, 3, 5, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,4

REFERENCES

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

LINKS

Table of n, a(n) for n=5..15.

CROSSREFS

Cf. A006820, A033301, A033483.

Sequence in context: A259301 A200777 A227827 * A122916 A132973 A107760

Adjacent sequences:  A033697 A033698 A033699 * A033701 A033702 A033703

KEYWORD

nonn,nice

AUTHOR

R. C. Read (rcread(AT)math.uwaterloo.ca)

STATUS

approved

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

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

Last modified August 28 08:35 EDT 2015. Contains 261118 sequences.