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!)
A099510 Triangle, read by rows, of trinomial coefficients arranged so that there are n+1 terms in row n by setting T(n,k) equal to the coefficient of z^k in (1 + 2*z + z^2)^(n-[k/2]), for n>=k>=0, where [k/2] is the integer floor of k/2. 5
1, 1, 2, 1, 4, 1, 1, 6, 6, 4, 1, 8, 15, 20, 1, 1, 10, 28, 56, 15, 6, 1, 12, 45, 120, 70, 56, 1, 1, 14, 66, 220, 210, 252, 28, 8, 1, 16, 91, 364, 495, 792, 210, 120, 1, 1, 18, 120, 560, 1001, 2002, 924, 792, 45, 10, 1, 20, 153, 816, 1820, 4368, 3003, 3432, 495, 220, 1, 1, 22, 190 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Row sums form A099511. In general if T(n,k) = coefficient of z^k in (a + b*z + c*z^2)^(n-[k/2]), then the resulting number triangle will have the o.g.f.: ((1-a*x-c*x^2*y^2) + b*x*y)/((1-a*x-c*x^2*y^2)^2 - x*(b*x*y)^2).
LINKS
FORMULA
G.f.: (1-x+2*x*y-x^2*y^2)/((1-x)^2-2*x^2*y^2-2*x^3*y^2+x^4*y^4). T(n, k) = binomial(2*n-2*(k\2), k).
EXAMPLE
Rows begin:
[1],
[1,2],
[1,4,1],
[1,6,6,4],
[1,8,15,20,1],
[1,10,28,56,15,6],
[1,12,45,120,70,56,1],
[1,14,66,220,210,252,28,8],
[1,16,91,364,495,792,210,120,1],
[1,18,120,560,1001,2002,924,792,45,10],...
and can be derived from coefficients of (1+2*z+z^2)^n:
[1],
[1,2,1],
[1,4,6,4,1],
[1,6,15,20,15,6,1],
[1,8,28,56,70,56,28,8,1],
[1,10,45,120,210,252,210,120,45,10,1],...
by shifting each column k down by [k/2] rows.
PROG
(PARI) T(n, k)=if(n<k || k<0, 0, polcoeff((1+2*z+z^2+z*O(z^k))^(n-k\2), k, z))
CROSSREFS
Sequence in context: A133934 A055327 A105260 * A348593 A211232 A137633
KEYWORD
nonn,tabl
AUTHOR
Paul D. Hanna, Oct 20 2004
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 24 17:10 EDT 2024. Contains 371962 sequences. (Running on oeis4.)