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 A062270 #23 May 31 2022 11:23:36
%S A062270 3,45,175,693,11011,2807805,302307005,402243205,714186915,42803602439,
%T A062270 11086133031701,5908908905896633,1488200914442251997,
%U A062270 3041106216468949733,16213234917387714257,21611220383343195817
%N A062270 Numerators in partial products of the twin prime constant.
%C A062270 For n>1, a(n) is the absolute value of the numerator of the determinant of the n X n matrix with elements M[i,j] = 1/(prime(i)-1)^2 for i=j and 1 otherwise. - _Alexander Adamchuk_, Jun 02 2006
%D A062270 Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 84-94.
%D A062270 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, ch. 22.20
%H A062270 Steven R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/hrdyltl/hrdyltl.html">Hardy-Littlewood Constants</a> [Broken link]
%H A062270 Steven R. Finch, <a href="http://web.archive.org/web/20010614100031/http://www.mathsoft.com/asolve/constant/hrdyltl/hrdyltl.html">Hardy-Littlewood Constants</a> [From the Wayback machine]
%F A062270 a(n) = a(n-1)*(prime(n)*(prime(n)-2)) / gcd(a(n-1)*prime(n)*(prime(n)-2), A062271(n)) for n > 2.
%e A062270 a(4) = 175 = 3*1*5*3*7*5 / gcd(3*1*5*3*7*5, 2*2*4*4*6*6).
%t A062270 Numerator[Abs[Table[ Det[ DiagonalMatrix[ Table[ 1/(Prime[i]-1)^2 - 1, {i, 1, n} ] ] + 1 ], {n, 2, 20} ]]] (* _Alexander Adamchuk_, Jun 02 2006 *)
%o A062270 (PARI) a(n) = numerator(prod(k=2, n, 1-1/(prime(k)-1)^2)); \\ _Michel Marcus_, May 31 2022
%Y A062270 Cf. A062271 (denominators), A005597 (decimal expansion).
%K A062270 easy,nonn,frac
%O A062270 2,1
%A A062270 _Frank Ellermann_, Jun 16 2001
%E A062270 Typo in link corrected by _Martin Griffiths_, Apr 03 2009