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 A068087 #14 Feb 16 2025 08:32:45 %S A068087 1,4,81,4096,390625,60466176,13841287201,4398046511104, %T A068087 1853020188851841,1000000000000000000,672749994932560009201, %U A068087 552061438912436417593344,542800770374370512771595361,629983141281877223603213172736,852226929923929274082183837890625 %N A068087 a(n) = n^(2*n-2). %C A068087 Number of spanning trees in the bipartite graph K(n,n). In general the number of spanning trees in the bipartite graph K(m,n) is m^(n-1) * n^(m-1). %H A068087 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteBipartiteGraph.html">Complete Bipartite Graph</a> %H A068087 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SpanningTree.html">Spanning Tree</a> %o A068087 (PARI) a(n)=n^(2*n-2) \\ _Charles R Greathouse IV_, Mar 31 2016 %Y A068087 a(n) = A000169(n)^2. %Y A068087 Cf. A069996, A001787, A072590, A294360. %K A068087 nonn,easy %O A068087 1,2 %A A068087 Sharon Sela (sharonsela(AT)hotmail.com), May 06 2002