The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
1, 12, 192, 6480, 179200, 4410000, 100590336, 2175421248, 45229916160, 912328045200, 17965673440000, 346945899203904, 6592659294154752, 123580568462478400, 2289795064260480000, 42003815644116000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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
LINKS
FORMULA
For n >= 3, a(n) = ((2n-2)^2)*(2n-3)*C(2n-4, n-2)^2. - David Wasserman, Jun 08 2002
PROG
(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
CROSSREFS
Sequence in context: A359453 A272959 A095351 * A210356 A328261 A264603
KEYWORD
nonn,easy
AUTHOR
Roger Cuculière, May 28 2001
EXTENSIONS
More terms from David Wasserman, Jun 08 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 22:16 EDT 2024. Contains 372741 sequences. (Running on oeis4.)