Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061065
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061065 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. +0
1
1, 12, 192, 6480, 179200, 4410000, 100590336, 2175421248, 45229916160, 912328045200, 17965673440000, 346945899203904, 6592659294154752, 123580568462478400, 2289795064260480000, 42003815644116000000 (list; graph; listen)
OFFSET

1,2

FORMULA

For n >= 3, a(n)=((2n-2)^2)*(2n-3)*C(2n-4, n-2)^2. - David Wasserman (dwasserm(AT)earthlink.net), Jun 08 2002

CROSSREFS

Cf. A005249, A000515.

Sequence in context: A086948 A051620 A095351 this_sequence A034671 A066230 A048667

Adjacent sequences: A061062 A061063 A061064 this_sequence A061066 A061067 A061068

KEYWORD

nonn,easy

AUTHOR

Roger Cuculiere (cuculier(AT)imaginet.fr), May 28 2001

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Jun 08 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research