|
Search: id:A136388
|
|
|
| A136388 |
|
Triangle read by rows of coefficients of Chebyshev-like polynomials P_{n,2}(x) with 0 omitted (exponents in increasing order). |
|
+0
1
|
|
| 1, -2, 2, 1, -5, 4, 4, -12, 8, -1, 13, -28, 16, -6, 38, -64, 32, 1, -25, 104, -144, 64, 8, -88, 272, -320, 128, -1, 41, -280, 688, -704, 256, -10, 170, -832, 1696, -1536, 512, 1, -61, 620, -2352, 4096, -3328, 1024, 12, -292, 2072, -6400, 9728, -7168, 2048
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
If U_n(x), T_n(x) are Chebyshev's polynomials then U_n(x)=P_{n,0}(x), T_n(x)=P_{n,1}(x).
Let n>=2 and k be of the same parity. Consider a set X consisting of (n+k)/2-2 main blocks of the size 2 and an additional block of the size 2, then (-1)^((n-k)/2)a(n,k) is the number of n-2-subsets of X intersecting each main block.
|
|
LINKS
|
Milan Janjic, Two enumerative functions.
|
|
FORMULA
|
If n>=2 and k are of the same parity then a(n,k)= (-1)^((n-k)/2)*sum((-1)^i*binomial((n+k)/2-2, i)*binomial(n+k-2-2*i, n-2), i=0..(n+k)/2-2), and a(n,k)=0 if n and k are of different parity.
|
|
EXAMPLE
|
Rows are (1),(-2,2),(1,-5,4),(4,-12,8),(-1,13,-28,16),...
since P_{2,2}=x^2, P_{3,2}=-2x+2x^3, P_{4,2}=1-5x^2+4x^4,...
|
|
MAPLE
|
if modp(n-k, 2)=0 then a[n, k]:=(-1)^((n-k)/2)*sum((-1)^i*binomial((n+k)/2-2, i)*binomial(n+k-2-2*i, n-2), i=0..(n+k)/2-2); end if;
|
|
CROSSREFS
|
Cf. A008310, A053117.
Adjacent sequences: A136385 A136386 A136387 this_sequence A136389 A136390 A136391
Sequence in context: A125177 A125178 A101975 this_sequence A099605 A079218 A079220
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
Milan R. Janjic (agnus(AT)blic.net), Mar 30 2008, entry revised Apr 05 2008
|
|
|
Search completed in 0.002 seconds
|
