Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033886 Number of connected regular graphs of degree 4 and girth >= 4 containing n nodes. +0
4
1, 0, 2, 2, 12, 31, 220, 1606, 16828, 193900, 2452818 (list; graph; listen)
OFFSET

8,3
LINKS

M. Meringer, Tables of Regular Graphs

CROSSREFS

Cf. A014371.

Sequence in context: A052612 A130306 A093044 this_sequence A087131 A131444 A013315

Adjacent sequences: A033883 A033884 A033885 this_sequence A033887 A033888 A033889

KEYWORD

nonn,nice,hard

AUTHOR

njas, Dec 17 2000

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 July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.