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 A061065 #17 Feb 11 2020 12:03:13
%S A061065 1,12,192,6480,179200,4410000,100590336,2175421248,45229916160,
%T A061065 912328045200,17965673440000,346945899203904,6592659294154752,
%U A061065 123580568462478400,2289795064260480000,42003815644116000000
%N A061065 For n <= 6, entry of maximal modulus in the inverse of the n-th Hilbert matrix. For n >= 3, this is the (n-1,n-1)-th entry.
%C A061065 Incorrect version of the largest element in the inverse of Hilbert's matrix. See A210356 for the correct version. See A210357 for the location of the maximal value. - _T. D. Noe_ and _Clark Kimberling_, Mar 28 2012
%H A061065 Harry J. Smith, <a href="/A061065/b061065.txt">Table of n, a(n) for n = 1..100</a>
%F A061065 For n >= 3, a(n) = ((2n-2)^2)*(2n-3)*C(2n-4, n-2)^2. - _David Wasserman_, Jun 08 2002
%o A061065 (PARI) { for (n=1, 100, if (n>2, a=((2*n-2)^2)*(2*n-3)*binomial(2*n-4, n-2)^2, if (n==1, a=1, a=12)); write("b061065.txt", n, " ", a) ) } \\ _Harry J. Smith_, Jul 17 2009
%Y A061065 Cf. A005249, A000515, A210356, A210357.
%K A061065 nonn,easy
%O A061065 1,2
%A A061065 _Roger Cuculière_, May 28 2001
%E A061065 More terms from _David Wasserman_, Jun 08 2002