|
Search: id:A059441
|
|
|
| A059441 |
|
Triangle T(n,k) (n >= 1, 0<=k<=n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows. |
|
+0
4
|
|
| 1, 1, 1, 1, 0, 1, 1, 3, 3, 1, 1, 0, 12, 0, 1, 1, 15, 70, 70, 15, 1, 1, 0, 465, 0, 465, 0, 1, 1, 105, 3507, 19355, 19355, 3507, 105, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 279.
|
|
EXAMPLE
|
1; 1,1; 1,0,1; 1,3,3,1; ...
|
|
CROSSREFS
|
Diagonals give A001205, A002829, A005815.
Adjacent sequences: A059438 A059439 A059440 this_sequence A059442 A059443 A059444
Sequence in context: A065547 A143333 A065551 this_sequence A059790 A130778 A016554
|
|
KEYWORD
|
tabl,nice,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 01 2001
|
|
|
Search completed in 0.002 seconds
|
