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 A336810 #60 Aug 05 2023 22:15:22
%S A336810 2,1,1,179,2,1196852626800230399,1,1,179,1,1
%N A336810 Continued fraction expansion of Sum_{k>=0} 1/(k!)!.
%C A336810 a(11), a(21), and a(41) have 152, 1349, and 12981 digits, respectively.
%H A336810 Georg Fischer, <a href="/A336810/b336810.txt">Table of n, a(n) for n = 0..20</a>
%H A336810 Georg Fischer, <a href="/A336810/a336810.txt">Table of n, a(n) for n = 0..139</a>
%H A336810 Daniel Hoyt, <a href="/A336810/a336810_2.txt">Python program that generates the continued fraction from formula</a>.
%H A336810 Alfred J. van der Poorten and Jeffrey Shallit, <a href="https://doi.org/10.1016/0022-314X(92)90042-N">Folded continued fractions</a>, Journal of Number Theory, Vol. 40, Issue 2, 1992, pp. 237-250 (cf. prop. 2).
%F A336810 The peak terms have the form ((k+1)!)! / ((k!)!)^2 - 1. - _Georg Fischer_, Oct 19 2022 [pers. comm. with J. Shallit]
%F A336810 Let P(k) = ((k+1)!)! / ((k!)!)^2 - 1. After the first term, the rest of the sequence is an interleaving between the n-th runs of '1, 1' and '2' in A157196, and P(A001511(n)+1). - _Daniel Hoyt_, Jun 26 2023
%t A336810 ContinuedFraction[Sum[1/(k!)!, {k, 0, 6}], 21] (* _Amiram Eldar_, Nov 22 2020 *)
%o A336810 (PARI) contfrac(suminf(k=0, 1/(k!)!))
%Y A336810 Cf. A336686 (decimal expansion).
%Y A336810 Cf. A001511, A157196, A363841.
%K A336810 nonn,cofr
%O A336810 0,1
%A A336810 _Daniel Hoyt_, Nov 20 2020