|
Search: id:A046860
|
|
|
| A046860 |
|
Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes. |
|
+0
2
|
|
| 1, 1, 4, 1, 24, 48, 1, 160, 1152, 1536, 1, 1440, 30720, 122880, 122880, 1, 18304, 1152000, 10813440, 29491200, 23592960, 1, 330624, 65630208, 1348730880, 7707033600, 15854469120, 10569646080, 1, 8488960, 5858721792, 261070258176
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
R. C. Read, The number of k-colored graphs on labeled nodes, Canad. J. Math., 12 (1960), 410-414.
|
|
FORMULA
|
a(n, k) = Sum_{r=1..n-1} C(n, r) 2^(r*(n-r)) a(r, k-1).
|
|
EXAMPLE
|
1; 1 4; 1 24 48;...
|
|
CROSSREFS
|
Column #1 gives A000683.
Cf. A000683, A006201, A006202.
Sequence in context: A128417 A136232 A079621 this_sequence A089505 A062328 A136234
Adjacent sequences: A046857 A046858 A046859 this_sequence A046861 A046862 A046863
|
|
KEYWORD
|
tabl,easy,nice,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 04 2000
|
|
|
Search completed in 0.002 seconds
|
