The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A198321 Triangle T(n,k), read by rows, given by (0,1,0,0,0,0,0,0,0,0,0,...) DELTA (1,1,-1,1,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938. 1
1, 0, 1, 0, 1, 2, 0, 1, 3, 3, 0, 1, 4, 6, 4, 0, 1, 5, 10, 10, 5, 0, 1, 6, 15, 20, 15, 6, 0, 1, 7, 21, 35, 35, 21, 7, 0, 1, 8, 28, 56, 70, 56, 28, 8, 0, 1, 9, 36, 84, 126, 126, 84, 36, 9, 0, 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 0, 1, 11, 55, 165, 330 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Variant of A074909, A135278.
LINKS
FORMULA
T(n,0)=0^n, T(n,k)=binomial(n,k-1) for 1<=k<=n.
Sum_{0<=k<=n} T(n,k)*x^k = x*((x+1)^n-x^n) for n>0.
G.f.: (1-(1+y)*x+y*(1+y)*x^2)/((1-(1+y)*x)*(1-y*x)).
T(n,k) = T(n-1,k) + 2*T(n-1,k-1) - T(n-2,k-1) - T(n-2,k-2), T(0,0) = 1, T(1,0) = 0, T(1,1) = 1, T(2,0) = 0, T(2,1) = 1, T(2,2) = 2, T(n,k) = 0 if k<0 or if k>n. - Philippe Deléham, Feb 12 2014
EXAMPLE
Triangle begins :
1
0, 1
0, 1, 2
0, 1, 3, 3
0, 1, 4, 6, 4
0, 1, 5, 10, 10, 5
0, 1, 6, 15, 20, 15, 6
CROSSREFS
Sequence in context: A089112 A155584 A139600 * A325003 A166278 A365515
KEYWORD
easy,nonn,tabl
AUTHOR
Philippe Deléham, Nov 01 2011
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 May 14 12:08 EDT 2024. Contains 372532 sequences. (Running on oeis4.)