Search: id:A049310
Results 1-1 of 1 results found.
%I A049310
%S A049310 1,0,1,1,0,1,0,2,0,1,1,0,3,0,1,0,3,0,4,0,1,1,0,6,0,5,0,1,0,4,0,
%T A049310 10,0,6,0,1,1,0,10,0,15,0,7,0,1,0,5,0,20,0,21,0,8,0,1,1,0,15,0,
%U A049310 35,0,28,0,9,0,1,0,6,0,35,0,56,0,36,0,10,0,1,1,0,21,0,70,0,84,0
%V A049310 1,0,1,-1,0,1,0,-2,0,1,1,0,-3,0,1,0,3,0,-4,0,1,-1,0,6,0,-5,0,1,0,-4,0,
%W A049310 10,0,-6,0,1,1,0,-10,0,15,0,-7,0,1,0,5,0,-20,0,21,0,-8,0,1,-1,0,15,0,
%X A049310 -35,0,28,0,-9,0,1,0,-6,0,35,0,-56,0,36,0,-10,0,1,1,0,-21,0,70,0,-84,0
%N A049310 Triangle of coefficients of Chebyshev's S(n,x) := U(n,x/2) polynomials
(exponents in increasing order).
%C A049310 G.f. for row polynomials S(n,x) (signed triangle): 1/(1-x*z+z^2). Unsigned
triangle |a(n,m)| has Fibonacci polynomials F(n+1,x) as row polynomials
with G.f. 1/(1-x*z-z^2). |a(n,m)| triangle has rows of Pascal's triangle
A007318 in the even numbered diagonals (odd numbered ones have only
0's).
%C A049310 Row sums (unsigned triangle) A000045(n+1) (Fibonacci). Row sums (signed
triangle) S(n,1) sequence = periodic(1,1,0,-1,-1,0) = A010892.
%C A049310 S(n,x) is the characteristic polynomial of the adjacency matrix of the
n-path. - Michael Somos, Jun 24 2002
%C A049310 |T(n,k)|=number of compositions of n+1 into k+1 odd parts. Example: |T(7,
3)|=10 because we have (1,1,3,3),(1,3,1,3),(1,3,3,1),(3,1,1,3),(3,
1,3,1),(3,3,1,1), (1,1,1,5),(1,1,5,1),(1,5,1,1) and (5,1,1,1). -
Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 09 2005
%D A049310 D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 232,
Sect. 3.3.38.
%D A049310 Theodore J. Rivlin, Chebyshev polynomials: from approximation theory
to algebra and number theory, 2. ed., Wiley, New York, 1990.
%H A049310 T. D. Noe, Rows 0 to 100 of the triangle, flattened.
a>
%H A049310 S. R. Finch, P. Sebah and Z.-Q. Bai,
Odd Entries in Pascal's Trinomial Triangle (arXiv:0802.2654)
%H A049310 Eric Weisstein's World of Mathematics, Fibonacci Polynomial
%H A049310 Index entries for sequences related to
Chebyshev polynomials.
%F A049310 T(n, k) := 0 if n2, F[n] = x*F[n-1]+F[n-2].
%e A049310 {1}; {0,1}; {-1,0,1}; {0,-2,0,1}; {1,0,-3,0,1};... E.g. fourth row {0,
-2,0,1} corresponds to polynomial S(3,x)= -2*x+x^3.
%e A049310 Triangle of absolute values of coefficients (coefficients of Fibonacci
polynomials) with exponents in increasing order begins:
%e A049310 [1]
%e A049310 [0, 1]
%e A049310 [1, 0, 1]
%e A049310 [0, 2, 0, 1]
%e A049310 [1, 0, 3, 0, 1]
%e A049310 [0, 3, 0, 4, 0, 1]
%e A049310 [1, 0, 6, 0, 5, 0, 1]
%e A049310 [0, 4, 0, 10, 0, 6, 0, 1]
%e A049310 [1, 0, 10, 0, 15, 0, 7, 0, 1]
%e A049310 [0, 5, 0, 20, 0, 21, 0, 8, 0, 1]
%o A049310 (PARI) T(n,k)=if(k<0|k>n|(n+k)%2,0,(-1)^((n+k)/2+k)*binomial((n+k)/2,
k))
%Y A049310 Cf. A010892.
%Y A049310 Reflection of A053119. Without zeros: A053112.
%Y A049310 Sequence in context: A029407 A099544 A036414 this_sequence A036851 A036850
A113206
%Y A049310 Adjacent sequences: A049307 A049308 A049309 this_sequence A049311 A049312
A049313
%K A049310 easy,nice,sign,tabl,core
%O A049310 0,8
%A A049310 Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)
Search completed in 0.003 seconds