Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069945
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069945 Let M_k be the k X k matrix M_k(i,j)=1/binomial(i+n,j); then a(n)=1/det(M_(n+1)). +0
1
1, -6, -360, 252000, 2222640000, -258768639360000, -410299414270986240000, 9061429740221589431500800000, 2835046804394206618956825845760000000, -12733381268715468286016211650968992153600000000 (list; graph; listen)
OFFSET

1,2

COMMENT

If k>n+1 det(M_k)=0

FORMULA

|a(n)| = det(M^(-1)), where M is an n X n matrix with M[i, j]=i/(i+j-1) (or j/(i+j-1)). |a(n)| = 1/det(HilbertMatrix(n))/n! = A0052499(n)/n!. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 26 2003

PROGRAM

(PARI) for(n=0, 10, print1(1/matdet(matrix(n+1, n+1, i, j, 1/binomial(i+n, j))), ", "))

CROSSREFS

Sequence in context: A002684 A036281 A064350 this_sequence A086205 A042759 A099595

Adjacent sequences: A069942 A069943 A069944 this_sequence A069946 A069947 A069948

KEYWORD

easy,sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 27 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research