|
Search: id:A068934
|
|
|
| A068934 |
|
Triangular array C(n, r) = number of connected r-regular graphs with n nodes, 0 <= r < n. |
|
+0
3
|
|
| 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 5, 6, 3, 1, 1, 0, 0, 1, 0, 16, 0, 4, 0, 1, 0, 0, 1, 19, 59, 60, 21, 5, 1, 1, 0, 0, 1, 0, 265, 0, 266, 0, 6, 0, 1, 0, 0, 1, 85, 1544, 7848, 7849, 1547, 94, 9, 1, 1, 0, 0, 1, 0, 10778, 0, 367860, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,19
|
|
|
COMMENT
|
A graph is called r-regular if every node has exactly r edges. Row sums give A005177. The numbers in this table were copied from the sequences A002851 (r = 3), A006820 (r = 4), A006821 (r = 5), A006822 (r = 6), A014377 (r = 7), A014378 (r = 8), A014381 (r = 9), A014382 (r = 10) and A014384 (r = 11).
|
|
FORMULA
|
C(n, r) = A051031(n, r) - A068933(n, r).
|
|
CROSSREFS
|
Cf. A002851, A005177, A006820-A006822, A014377, A014378, A014381, A014382, A014384, A051031, A068933.
Adjacent sequences: A068931 A068932 A068933 this_sequence A068935 A068936 A068937
Sequence in context: A073779 A081227 A004610 this_sequence A035200 A056979 A087812
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
David Wasserman (dwasserm(AT)earthlink.net), Mar 08 2002
|
|
|
Search completed in 0.002 seconds
|
