Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014371
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014371 Number of trivalent connected graphs with 2n nodes and girth >= 4. +0
5
1, 2, 6, 22, 110, 792, 7805, 97546, 1435720, 23780814, 432757568 (list; graph; listen)
OFFSET

3,2

REFERENCES

CRC Handbook of Combinatorial Designs, 1996, p. 647.

LINKS

M. Meringer, Tables of Regular Graphs

CROSSREFS

Cf. A033886, A058343.

Sequence in context: A103941 A064643 A129535 this_sequence A111280 A095817 A101042

Adjacent sequences: A014368 A014369 A014370 this_sequence A014372 A014373 A014374

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research