Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014382
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014382 Number of connected regular graphs of degree 10 with n nodes. +0
11
1, 1, 10, 540, 805579 (list; graph; listen)
OFFSET

11,3

REFERENCES

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

I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Probl\`{e}mes combinatoires et th\'{e}orie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.

LINKS

M. Meringer, Tables of Regular Graphs

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Connected regular graphs of degree k: A002851 (k=3), A006820 (k=4), A006821 (k=5), A006822 (k=6), A014377 (k=7), A014378 (k=8), A014381 (k=9), A014382 (k=10), A014384 (k=11).

Sequence in context: A095232 A042209 A003399 this_sequence A035308 A006441 A042751

Adjacent sequences: A014379 A014380 A014381 this_sequence A014383 A014384 A014385

KEYWORD

nonn

AUTHOR

njas

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research