login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A059328
Table T(n,k) = T(n - 1,k) + T(n,k - 1) + T(n - 1,k)*T(n,k - 1) starting with T(0,0)=1, read by antidiagonals.
1
1, 1, 1, 1, 3, 1, 1, 7, 7, 1, 1, 15, 63, 15, 1, 1, 31, 1023, 1023, 31, 1, 1, 63, 32767, 1048575, 32767, 63, 1, 1, 127, 2097151, 34359738367, 34359738367, 2097151, 127, 1, 1, 255, 268435455, 72057594037927935, 1180591620717411303423
OFFSET
0,5
COMMENTS
In binary representation T(n,k) is the concatenation of T(n-1,k-1) and T(n-1,k), 0<k<n. - Reinhard Zumkeller, Jan 23 2003
FORMULA
T(n, k) = 2^C(n+k, n)-1; a(n) = 2^A007318(n)-1.
If U(n, k) := 1 + T(n, k), then U(n, k) = U(n-1, k) * U(n, k-1). - Michael Somos, Jan 07 2017
MATHEMATICA
Table[2^(Binomial[n, k]) - 1, {n, 0, 5}, {k, 0, n}] (* G. C. Greubel, Jan 07 2017 *)
CROSSREFS
Cf. A007318.
Sequence in context: A141689 A058669 A057004 * A174387 A176791 A259471
KEYWORD
nonn,tabl
AUTHOR
Henry Bottomley, Jan 26 2001
STATUS
approved