login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216226 Square array T, read by antidiagonals: T(n,k) = 0 if n-k>=1 or if k-n>=4, T(0,0) = T(0,1) = T(0,2) = T(0,3) = 1, T(n,k) = T(n-1,k) + T(n,k-1). 11
1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 0, 3, 2, 0, 0, 0, 3, 5, 0, 0, 0, 0, 0, 8, 5, 0, 0, 0, 0, 0, 8, 13, 0, 0, 0, 0, 0, 0, 0, 21, 13, 0, 0, 0, 0, 0, 0, 0, 21, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 34, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
T(n,n) = A000045(2*n-1) = A001519(n).
T(n,n+1) = A000045(2*n+1) = A001519(n+1).
T(n,n+2) = T(n,n+3) = A000045(2*n+2) = A001906(n+1).
Sum_{k, 0<=k<=n} T(n-k,k) = A000045(n+1).
Sum_{k, k>=0} T(n,k) = A000285(2*n+1).
Sum_{n, n>=0} T(n,k) = A000285(2*k-2), k>=2.
EXAMPLE
Square array begins:
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, ... row n=0
0, 1, 2, 3, 3, 0, 0, 0, 0, 0, ... row n=1
0, 0, 2, 5, 8, 8, 0, 0, 0, 0, ... row n=2
0, 0, 0, 5, 13, 21, 21, 0, 0, 0, ... row n=3
0, 0, 0, 0, 13, 34, 55, 55, 0, 0, ... row n=4
0, 0, 0, 0, 0, 34, 89, 144, 144, 0, ... row n=5
...
CROSSREFS
Cf. A000045 (Fibonacci numbers), A000285, A001519, A001906, A068914
Sequence in context: A113503 A082507 A132349 * A123391 A212172 A275812
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)