|
|
PROG
|
/* bc , formula r(n, k) from A000892 */
define factorial(n) {
auto prod;
prod=1;
while(n>=2)prod*=n--;
return prod;
}
define binomial(n, i) {
if(i<0||i>n)return 0;
return factorial(n)/(factorial(i)*factorial(n-i));
}
define r(n, k) {
auto j, sum;
sum=0;
for(j=0; j<=k+1; j++) {
sum+=(-1)^j*(k+1-j)^n*binomial(n+1, j);
}
return sum;
}
define t(n, k) {
auto sum, i;
sum=0;
for(i=0; i<=(k-1); i++)sum+=r((n+k)/2, i)*r((n+k)-(n+k)/2, (k-1)-i);
return sum*binomial((n+k), (n+k)/2);
}
for(n=1; n<=100; n++) {
print n, " ", t(n, 8), "\n";
}
quit
|
