login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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 (list; table; graph; refs; listen; history; internal format)
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 (reinhard.zumkeller(AT)gmail.com), Jan 23 2003

FORMULA

T(n, k)=2^C(n+k, n)-1; a(n)=2^A007318(n)-1.

CROSSREFS

Sequence in context: A141689 A058669 A057004 * A174387 A176791 A075440

Adjacent sequences:  A059325 A059326 A059327 * A059329 A059330 A059331

KEYWORD

nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jan 26 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:07 EST 2012. Contains 205904 sequences.