|
| |
|
|
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, -6, -360, 252000, 2222640000, -258768639360000, -410299414270986240000, 9061429740221589431500800000, 2835046804394206618956825845760000000, -12733381268715468286016211650968992153600000000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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
|
|
|
PROG
| (PARI) for(n=0, 10, print1(1/matdet(matrix(n+1, n+1, i, j, 1/binomial(i+n, j))), ", "))
|
|
|
CROSSREFS
| Sequence in context: A036281 A202367 A064350 * A086205 A173608 A042759
Adjacent sequences: A069942 A069943 A069944 * A069946 A069947 A069948
|
|
|
KEYWORD
| easy,sign
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 27 2002
|
| |
|
|
