This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A052263 #13 May 10 2025 23:14:44
%S A052263 0,0,0,0,1,240,62720,23224320,13440516096,12754259804160,
%T A052263 20377681883299840,55671587500342640640,262483693581093123915776,
%U A052263 2147534811240814766425374720,30585643102219392981931508367360
%N A052263 Number of 5-colored labeled graphs on n nodes (divided by 1024).
%H A052263 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 A052263 a(n, k) = (1/k)*Sum_{r=1..n-1} C(n, r) 2^(r*(n-r)) a(r, k-1).
%Y A052263 Cf. A000683, A006201, A006202.
%K A052263 easy,nonn
%O A052263 1,6
%A A052263 _Vladeta Jovovic_, Feb 03 2000