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 A100070 #18 Nov 17 2017 03:42:48
%S A100070 6,117,5632,515625,77262336,17230990189,5360119185408,
%T A100070 2219048868131217,1180000000000000000,783948341202404638821,
%U A100070 636404158746280870281216,619884903445287035295372217,713552333492738487958741450752
%N A100070 Number a(n) of forests with two components in the complete bipartite graph K_{n,n}.
%C A100070 This sequence (a(n)) appears to dominate the sequence (n^{2n-2}) of the number of spanning trees in K_{n,n} for n>1. This shows that the sequence of independent set numbers for the cycle matroid of K_{n,n} is not monotone increasing unlike the complete graph K_{n}.
%H A100070 G. C. Greubel, <a href="/A100070/b100070.txt">Table of n, a(n) for n = 2..214</a>
%H A100070 N. Eaton, W. Kook and L. Thoma, <a href="http://www.math.uri.edu/~eaton/UnimodKnn.pdf">Monotonicity for complete graphs</a>, preprint, 2004.
%F A100070 a(n) = 2*(n^2 - n)^(n-1) + (1/2)*Sum_{x=1..(n-1)} Sum_{y=1..(n-1)} b(n, x, y), where b(n, x, y) = binomial(n,x)*binomial(n,y)*x^(y-1)*y^(x-1)*(n-x)^(n-y-1)*(n-y)^(n-x-1).
%e A100070 a(2)=6 because K_{2,2} is C_{4} the cycle of length 4 and there are 6 forests with two components in C_{4}.
%t A100070 a[n_]:=Sum[Binomial[n, x]*Binomial[n, y]*x^(y-1)*y^(x-1)*(n-x)^(n-y-1)*(n-y)^(n-x-1), {x, 1, n-1}, {y, 1, n-1}]/2 + (2*(n^2-n)^(n-1)); Table[a[n], {n, 2, 10}] (* This will generate a(n) from n=2 to 10. *)
%Y A100070 Cf. A000272, A069087, A083483.
%K A100070 nonn
%O A100070 2,1
%A A100070 Woong Kook (andrewk(AT)math.uri.edu), Nov 02 2004