login
Number of 5-colored labeled graphs on n nodes(divided by 1024).
0

%I #10 Jun 29 2017 08:00:21

%S 0,0,0,0,1,240,62720,23224320,13440516096,12754259804160,

%T 20377681883299840,55671587500342640640,262483693581093123915776,

%U 2147534811240814766425374720,30585643102219392981931508367360

%N Number of 5-colored labeled graphs on n nodes(divided by 1024).

%H R. C. Read, <a href="http://cms.math.ca/10.4153/CJM-1960-035-0">The number of k-colored graphs on labelled nodes</a>, Canad. J. Math., 12 (1960), 410—414.

%F a(n, k) = (1/k)*Sum_{r=1..n-1} C(n, r) 2^(r*(n-r)) a(r, k-1).

%Y Cf. A000683, A006201, A006202.

%K easy,nonn

%O 1,6

%A _Vladeta Jovovic_, Feb 03 2000