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 A036245 #20 Aug 14 2021 03:42:52
%S A036245 1,4,37,596,14937,538328,26393009,1689690904,136891356233,
%T A036245 13690825314204,1656726754374917,238582343455302252,
%U A036245 40322072770700455505,7903364845400744581232,1778297412287938231232705,455252040910557587940153712,131569618120563430852935655473
%N A036245 Numerator of fraction equal to the continued fraction [ 0, 1, 4, ..., n^2 ].
%H A036245 Seiichi Manyama, <a href="/A036245/b036245.txt">Table of n, a(n) for n = 1..253</a>
%F A036245 a(n) = n^2 * a(n-1) + a(n-2) for n > 2. - _Seiichi Manyama_, Jun 05 2018
%F A036245 Lim_{n->oo} a(n)/A036246(n) = A073824. - _Jianing Song_, Nov 30 2019
%F A036245 a(n) ~ c * n^(2*n + 1) / exp(2*n), where c = 6.5347337470474831902516177263695578212049901774805425962967688345920604685... - _Vaclav Kotesovec_, Aug 14 2021
%t A036245 Table[Numerator[FromContinuedFraction[Range[0, n]^2]], {n, 1, 20}] (* _Vaclav Kotesovec_, Aug 14 2021 *)
%o A036245 (PARI) A036245(n) = my(v=vector(n+1)); for(i=1, n+1, if(i==1, v[i]=0, if(i==2, v[i]=1, v[i]=(i-1)^2*v[i-1]+v[i-2]))); v[n+1] \\ _Jianing Song_, Nov 30 2019
%Y A036245 Cf. A036246, A073824.
%K A036245 frac,nonn
%O A036245 1,2
%A A036245 _Jeff Burch_
%E A036245 More terms from _Seiichi Manyama_, Jun 05 2018