|
EXAMPLE
|
If the successive inverse binomial transforms are placed in a table,
then we see that the diagonal consists of all 1's:
n=0:[(1), 2, 5, 19, 81, 401, 2233, 13721, 91969, 666145,...];
n=1:[1, (1), 2, 9, 28, 145, 726, 4249, 27000, 186561,...];
n=2:[1, 0, (1), 5, 1, 79, 121, 1511, 6721, 50975,...];
n=3:[1, -1, 2, (1), -12, 113, -422, 2441, -6584, 44929,...];
n=4:[1, -2, 5, -9, (1), 157, -1263, 8173, -45087, 243261,...];
n=5:[1, -3, 10, -31, 76, (1), -1922, 19841, -153896, 1068065,...];
n=6:[1, -4, 17, -71, 273, -805, (1), 29339, -359135, 3316411,...];
n=7:[1, -5, 26, -135, 676, -3071, 10626, (1), -525144, 7462305,...];
n=8:[1, -6, 37, -229, 1393, -8087, 42313, -167839, (1), 10811609,...];
n=9:[1, -7, 50, -359, 2556, -17743, 116902, -691447, 3091768, (1),...].
|