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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 23:13 EST 2016. Contains 279021 sequences.