This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216218 Square array T, read by antidiagonals: T(n,k) = 0 if n-k>=2 or if k-n>=2, T(1,0) = T(0,0) = T(0,1) = 1, T(n,k) = T(n-1,k) + T(n,k-1). 11
 1, 1, 1, 0, 2, 0, 0, 2, 2, 0, 0, 0, 4, 0, 0, 0, 0, 4, 4, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 8, 8, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS With zeros omitted, this is A173862. LINKS FORMULA T(n,n) = T(n+1,n) = T(n,n+1) = 2^n = A000079(n). Sum_{k, 0<=k<=n} T(n-k,k) = A016116(n+1) = A163403(n+1). EXAMPLE Square array begins: 1, 1, 0, 0,  0,  0,  0, 0, ... row n=0 1, 2, 2, 0,  0,  0,  0, 0, ... row n=1 0, 2, 4, 4,  0,  0,  0, 0, ... row n=2 0, 0, 4, 8,  8,  0,  0, 0, ... row n=3 0, 0, 0, 8, 16, 16,  0, 0, ... row n=4 0, 0, 0, 0, 16, 32, 32, 0, ... row n=5 ... CROSSREFS Cf. A000079, A016116, A216216, A216210, A068913 Sequence in context: A130454 A070787 A033985 * A122071 A099766 A194947 Adjacent sequences:  A216215 A216216 A216217 * A216219 A216220 A216221 KEYWORD nonn,tabl AUTHOR Philippe Deléham, Mar 13 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 22 11:46 EDT 2019. Contains 322330 sequences. (Running on oeis4.)