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 A085525 #20 Mar 22 2025 11:42:54
%S A085525 0,1,64,6561,1048576,244140625,78364164096,33232930569601,
%T A085525 18014398509481984,12157665459056928801,10000000000000000000000,
%U A085525 9849732675807611094711841,11447545997288281555215581184,15502932802662396215269535105521,24201432355484595421941037243826176
%N A085525 a(n) = n^(2*n + 2).
%C A085525 a(n) is the number of labeled deterministic finite automata with n states, 2 letters, and one start and one accept state. - _Anand Jain_, Mar 20 2025
%p A085525 a:=n->mul(n^2,k=0..n):seq(a(n),n=0..14); # _Zerinvary Lajos_, Jan 26 2008
%t A085525 Table[n^(2n+2),{n,0,20}] (* _Harvey P. Dale_, Jun 04 2021 *)
%o A085525 (PARI) a(n) = n^(2*n + 2); \\ _Michel Marcus_, Jan 16 2019
%Y A085525 Cf. A070691.
%Y A085525 Equals A062206*A000290.
%K A085525 nonn
%O A085525 0,3
%A A085525 _N. J. A. Sloane_, Jul 05 2003