Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059328
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

0,5

COMMENT

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 this_sequence A075440 A137470 A112492

Adjacent sequences: A059325 A059326 A059327 this_sequence A059329 A059330 A059331

KEYWORD

nonn,tabl

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research