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 A082166 #20 Aug 14 2025 09:10:48
%S A082166 1,3,24,328,6427,164765,5228210,197897582,8704544263,436312502297,
%T A082166 24550259053858,1532241939881294,105048412352334420,
%U A082166 7847739530288388636,634523723233529394594,55206024491463561241758,5142697402316326354705599,510704188733699181740089521,53858874208665420063477867788
%N A082166 a(n) = A006689(n)/n^2.
%D A082166 Valery A. Liskovets, The number of initially connected automata, Kibernetika, (Kiev), No3 (1969), 16-19; Engl. transl.: Cybernetics, v.4 (1969), 259-262.
%H A082166 Valery A. Liskovets, <a href="http://www-igm.univ-mlv.fr/~fpsac/FPSAC03/ARTICLES/5.pdf">Exact enumeration of acyclic automata</a>, Proc. 15th Conf. "Formal Power Series and Algebr. Combin. (FPSAC'03)", 2003.
%H A082166 Valery A. Liskovets, <a href="http://dx.doi.org/10.1016/j.dam.2005.06.009">Exact enumeration of acyclic deterministic automata</a>, Discrete Appl. Math., 154, No.3 (2006), 537-551.
%t A082166 b[n_] := b[n] = If[n == 1, 1, n^(2*n)/(n-1)! - Sum[n^(2*(n-i))*b[i]/(n-i)!, {i, 1, n-1}]];
%t A082166 a[n_] := b[n]/n^2;
%t A082166 Array[a, 16] (* _Jean-François Alcover_, Aug 28 2019 *)
%Y A082166 Cf. A006689.
%K A082166 easy,nonn
%O A082166 1,2
%A A082166 _Valery A. Liskovets_, Apr 09 2003