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 A364844 #14 Aug 12 2023 00:54:30
%S A364844 3,22,474,1551,36163,292292,7327237,31311313
%N A364844 a(n) is the n-digit numerator of the fraction h/k with h and k coprime palindrome positive integers at which abs(h/k-Pi) is minimal.
%C A364844 a(2) = 22 corresponds to the numerator of A068028.
%H A364844 <a href="/index/Ph#Pi314">Index entries for sequences related to the number Pi</a>
%e A364844 n fraction approximated value
%e A364844 - ------------------- ------------------
%e A364844 1 3 3
%e A364844 2 22/7 3.1428571428571...
%e A364844 3 474/151 3.1390728476821...
%e A364844 4 1551/494 3.1396761133603...
%e A364844 5 36163/11511 3.1416036834332...
%e A364844 6 292292/93039 3.1416072829673...
%e A364844 7 7327237/2332332 3.1415926206046...
%e A364844 8 31311313/9966699 3.1415931192464...
%e A364844 ...
%t A364844 nmax = 8; a = {3}; hmin = kmin = 0; For[n = 2, n <= nmax, n++, minim = Infinity; h = Select[Range[10^(n - 1), 10^n - 1], PalindromeQ]; k = Select[Range[10^(n - 2), 10^n - 1], PalindromeQ]; lh = Length[h]; lk = Length[k]; For[i = 1, i <= lh, i++, For[j = 1, j <= lk, j++, If[(dist = Abs[Part[h, i]/Part[k, j] - Pi]) < minim && GCD[Part[h, i], Part[k, j]] == 1, minim = dist; hmin = Part[h, i]]]]; AppendTo[a, hmin]]; a
%Y A364844 Cf. A000796, A002113, A068028, A070252, A364845 (denominator), A364846.
%Y A364844 Cf. A355622, A355623.
%K A364844 nonn,base,frac,more
%O A364844 1,1
%A A364844 _Stefano Spezia_, Aug 10 2023