A051286 -id:A051286 - cp's OEIS frontend

A192685 Floor-Sqrt transform of numbers of A051286.

1, 1, 1, 2, 3, 5, 7, 12, 19, 30, 48, 76, 120, 191, 304, 483, 770, 1228, 1960, 3130, 5002, 7998, 12794, 20477, 32787, 52521, 84165, 134922, 216361, 347063, 556882, 893792, 1434893, 2304125, 3700752, 5945190, 9552745, 15352271, 24677134, 39672584, 63790535, 102586109, 165000118, 265424117

Offset: 0

Emanuele Munarini, Jul 07 2011

nonn

FSFromSeries[f_,x_,n_] := Map[Floor[Sqrt[#]]&,CoefficientList[Series[f,{x,0,n}],x]]
FSFromSeries[1/Sqrt[1-2x-x^2-2x^3+x^4],x,100]

a(n) = floor(sqrt(A051286(n))).

A049310 Triangle of coefficients of Chebyshev's S(n,x) := U(n,x/2) polynomials (exponents in increasing order).

Original entry on oeis.org

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, 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, -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

Offset: 0

Wolfdieter Lang

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).
Row sums (unsigned triangle) A000045(n+1) (Fibonacci). Row sums (signed triangle) S(n,1) sequence = periodic(1,1,0,-1,-1,0) = A010892.
Alternating row sums A049347(n) = S(n,-1) = periodic(1,-1,0). - Wolfdieter Lang, Nov 04 2011
S(n,x) is the characteristic polynomial of the adjacency matrix of the n-path. - Michael Somos, Jun 24 2002
S(n,x) is also the matching polynomial of the n-path. - Eric W. Weisstein, Apr 10 2017
|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, Apr 09 2005
S(n,x)= R(n,x) + S(n-2,x), n >= 2, S(-1,x)=0, S(0,x)=1, R(n,x):=2*T(n,x/2) = Sum_{m=0..n} A127672(n,m)*x^m (monic integer Chebyshev T-Polynomials). This is the rewritten so-called trace of the transfer matrix formula for the T-polynomials. - Wolfdieter Lang, Dec 02 2010
In a regular N-gon inscribed in a unit circle, the side length is d(N,1) = 2*sin(Pi/N). The length ratio R(N,k):=d(N,k)/d(N,1) for the (k-1)-th diagonal, with k from {2,3,...,floor(N/2)}, N >= 4, equals S(k-1,x) = sin(k*Pi/N)/sin(Pi/N) with x=rho(N):=R(N,2) = 2*cos(Pi/N). Example: N=7 (heptagon), rho=R(7,2), sigma:=R(N,3) = S(2,rho) = rho^2 - 1. Motivated by the quoted paper by P. Steinbach. - Wolfdieter Lang, Dec 02 2010
From Wolfdieter Lang, Jul 12 2011: (Start)
In q- or basic analysis, q-numbers are [n]_q := S(n-1,q+1/q) = (q^n-(1/q)^n)/(q-1/q), with the row polynomials S(n,x), n >= 0.
The zeros of the row polynomials S(n-1,x) are (from those of Chebyshev U-polynomials):
  x(n-1;k) = +- t(k,rho(n)), k = 1..ceiling((n-1)/2), n >= 2, with t(n,x) the row polynomials of A127672 and rho(n):= 2*cos(Pi/n). The simple vanishing zero for even n appears here as +0 and -0.
Factorization of the row polynomials S(n-1,x), x >= 1, in terms of the minimal polynomials of cos(2 Pi/2), called Psi(n,x), with coefficients given by A181875/A181876:
  S(n-1,x) = (2^(n-1))*Product_{n>=1}(Psi(d,x/2), 2 < d | 2n).
(From the rewritten eq. (3) of the Watkins and Zeitlin reference, given under A181872.) [See the W. Lang ArXiv link, Proposition 9, eq. (62). - Wolfdieter Lang, Apr 14 2018]
  (End)
The discriminants of the S(n,x) polynomials are found in A127670. - Wolfdieter Lang, Aug 03 2011
This is an example for a subclass of Riordan convolution arrays (lower triangular matrices) called Bell arrays. See the L. W. Shapiro et al. reference under A007318. If a Riordan array is named (G(z),F(z)) with F(z)=z*Fhat(z), the o.g.f. for the row polynomials is G(z)/(1-x*z*Fhat(z)), and it becomes a Bell array if G(z)=Fhat(z). For the present Bell type triangle G(z)=1/(1+z^2) (see the o.g.f. comment above). This leads to the o.g.f. for the column no. k, k >= 0, x^k/(1+x^2)^(k+1) (see the formula section), the one for the row sums and for the alternating row sums (see comments above). The Riordan (Bell) A- and Z-sequences (defined in a W. Lang link under A006232, with references) have o.g.f.s 1-x*c(x^2) and -x*c(x^2), with the o.g.f. of the Catalan numbers A000108. Together they lead to a recurrence given in the formula section. - Wolfdieter Lang, Nov 04 2011
The determinant of the N x N matrix S(N,[x[1], ..., x[N]]) with elements S(m-1,x[n]), for n, m = 1, 2, ..., N, and for any x[n], is identical with the determinant of V(N,[x[1], ..., x[N]]) with elements x[n]^(m-1) (a Vandermondian, which equals Product_{1 <= i < j<= N} (x[j] - x[i])). This is a special instance of a theorem valid for any N >= 1 and any monic polynomial system p(m,x), m>=0, with p(0,x) = 1. For this theorem see the Vein-Dale reference, p. 59. Thanks to L. Edson Jeffery for an email asking for a proof of the non-singularity of the matrix S(N,[x[1], ...., x[N]]) if and only if the x[j], j = 1..N, are pairwise distinct. - Wolfdieter Lang, Aug 26 2013
These S polynomials also appear in the context of modular forms. The rescaled Hecke operator T*n = n^((1-k)/2)*T_n acting on modular forms of weight k satisfies T*(p^n) = S(n, T*p), for each prime p and positive integer n. See the Koecher-Krieg reference, p. 223. - _Wolfdieter Lang, Jan 22 2016
For a shifted o.g.f. (mod signs), its compositional inverse, and connections to Motzkin and Fibonacci polynomials, non-crossing partitions and other combinatorial structures, see A097610. - Tom Copeland, Jan 23 2016
From M. Sinan Kul, Jan 30 2016; edited by Wolfdieter Lang, Jan 31 2016 and Feb 01 2016: (Start)
Solutions of the Diophantine equation u^2 + v^2 - k*u*v = 1 for integer k given by (u(k,n), v(k,n)) = (S(n,k), S(n-1,k)) because of the Cassini-Simson identity: S(n,x)^2 - S(n+1,x)*S(n-1, x) = 1, after use of the S-recurrence. Note that S(-n, x) = -S(-n-2, x), n >= 1, and the periodicity of some S(n, k) sequences.
Hence another way to obtain the row polynomials would be to take powers of the matrix [x, -1; 1,0]: S(n, x) = (([x, -1; 1, 0])^n)[1,1], n >= 0.
See also a Feb 01 2016 comment on A115139 for a well-known S(n, x) sum formula.
Then we have with the present T triangle
  A039834(n) = -i^(n+1)*T(n-1, k) where i is the imaginary unit and n >= 0.
  A051286(n) = Sum_{i=0..n} T(n,i)^2 (see the Philippe Deléham, Nov 21 2005 formula),
  A181545(n) = Sum_{i=0..n+1} abs(T(n,i)^3),
  A181546(n) = Sum_{i=0..n+1} T(n,i)^4,
  A181547(n) = Sum_{i=0..n+1} abs(T(n,i)^5).
S(n, 0) = A056594(n), and for k = 1..10 the sequences S(n-1, k) with offset n = 0 are A128834, A001477, A001906, A001353, A004254, A001109, A004187, A001090, A018913, A004189.
(End)
For more on the Diophantine equation presented by Kul, see the Ismail paper. - Tom Copeland, Jan 31 2016
The o.g.f. for the Legendre polynomials L(n,x) is 1 / sqrt(1- 2x*z + z^2), and squaring it gives the o.g.f. of U(n,x), A053117, so Sum_{k=0..n} L(k,x/2) L(n-k,x/2) = S(n,x). This gives S(n,x) = L(n/2,x/2)^2 + 2*Sum_{k=0..n/2-1} L(k,x/2) L(n-k,x/2) for n even and S(n,x) = 2*Sum_{k=0..(n-1)/2} L(k,x/2) L(n-k,x/2) for odd n. For a connection to elliptic curves and modular forms, see A053117. For the normalized Legendre polynomials, see A100258. For other properties and relations to other polynomials, see Allouche et al. - Tom Copeland, Feb 04 2016
LG(x,h1,h2) = -log(1 - h1*x + h2*x^2) = Sum_{n>0} F(n,-h1,h2,0,..,0) x^n/n is a log series generator of the bivariate row polynomials of A127672 with A127672(0,0) = 0 and where F(n,b1,b2,..,bn) are the Faber polynomials of A263916. Exp(LG(x,h1,h2)) = 1 / (1 - h1*x + h2*x^2 ) is the o.g.f. of the bivariate row polynomials of this entry. - Tom Copeland, Feb 15 2016 (Instances of the bivariate o.g.f. for this entry are on pp. 5 and 18 of Sunada. - Tom Copeland, Jan 18 2021)
For distinct odd primes p and q the Legendre symbol can be written as Legendre(q,p) = Product_{k=1..P} S(q-1, 2*cos(2*Pi*k/p)), with P = (p-1)/2. See the Lemmermeyer reference, eq. (8.1) on p. 236. Using the zeros of S(q-1, x) (see above) one has S(q-1, x) = Product_{l=1..Q} (x^2 - (2*cos(Pi*l/q))^2), with Q = (q-1)/2. Thus S(q-1, 2*cos(2*Pi*k/p)) = ((-4)^Q)*Product_{l=1..Q} (sin^2(2*Pi*k/p) - sin^2(Pi*l/q)) = ((-4)^Q)*Product_{m=1..Q} (sin^2(2*Pi*k/p) - sin^2(2*Pi*m/q)). For the proof of the last equality see a W. Lang comment on the triangle A057059 for n = Q and an obvious function f. This leads to Eisenstein's proof of the quadratic reciprocity law Legendre(q,p) = ((-1)^(P*Q)) * Legendre(p,q), See the Lemmermeyer reference, pp. 236-237. - Wolfdieter Lang, Aug 28 2016
For connections to generalized Fibonacci polynomials, compare their generating function on p. 5 of the Amdeberhan et al. link with the o.g.f. given above for the bivariate row polynomials of this entry. - Tom Copeland, Jan 08 2017
The formula for Ramanujan's tau function (see A000594) for prime powers is tau(p^k) = p^(11*k/2)*S(k, p^(-11/2)*tau(p)) for k >= 1, and p = A000040(n), n >= 1. See the Hardy reference, p. 164, eqs. (10.3.4) and (10.3.6) rewritten in terms of S. - Wolfdieter Lang, Jan 27 2017
From Wolfdieter Lang, May 08 2017: (Start)
The number of zeros Z(n) of the S(n, x) polynomials in the open interval (-1,+1) is 2*b(n) for even n >= 0 and 1 + 2*b(n) for odd n >= 1, where b(n) = floor(n/2) - floor((n+1)/3). This b(n) is the number of integers k in the interval (n+1)/3 < k <= floor(n/2). See a comment on the zeros of S(n, x) above, and b(n) = A008615(n-2), n >= 0. The numbers Z(n) have been proposed (with a conjecture related to A008611) by Michel Lagneau, as the number of zeros of Fibonacci polynomials on the imaginary axis (-I,+I), with I=sqrt(-1). They are Z(n) = A008611(n-1), n >= 0, with A008611(-1) = 0. Also Z(n) = A194960(n-4), n >= 0. Proof using the A008611 version. A194960 follows from this.
In general the number of zeros Z(a;n) of S(n, x) for n >= 0 in the open interval (-a,+a) for a from the interval (0,2) (x >= 2 never has zeros, and a=0 is trivial: Z(0;n) = 0) is with b(a;n) = floor(n//2) - floor((n+1)*arccos(a/2)/Pi), as above Z(a;n) = 2*b(a;n) for even n >= 0 and 1 + 2*b(a;n) for odd n >= 1. For the closed interval [-a,+a] Z(0;n) = 1 and for a from (0,1) one uses for Z(a;n) the values b(a;n) = floor(n/2) - ceiling((n+1)*arccos(a/2)/Pi) + 1. (End)
The Riordan row polynomials S(n, x) (Chebyshev S) belong to the Boas-Buck class (see a comment and references in A046521), hence they satisfy the Boas-Buck identity: (E_x - n*1)*S(n, x) = (E_x + 1)*Sum_{p=0..n-1} (1 - (-1)^p)*(-1)^((p+1)/2)*S(n-1-p, x), for n >= 0, where E_x = x*d/dx (Euler operator). For the triangle T(n, k) this entails a recurrence for the sequence of column k, given in the formula section. - Wolfdieter Lang, Aug 11 2017
The e.g.f. E(x,t) := Sum_{n>=0} (t^n/n!)*S(n,x) for the row polynomials is obtained via inverse Laplace transformation from the above given o.g.f. as E(x,t) = ((1/xm)*exp(t/xm) - (1/xp)*exp(t/xp) )/(xp - xm) with xp = (x + sqrt(x^2-4))/2 and xm = (x - sqrt(x^2-4))/2. - Wolfdieter Lang, Nov 08 2017
From Wolfdieter Lang, Apr 12 2018: (Start)
Factorization of row polynomials S(n, x), for n >= 1, in terms of C polynomials (not Chebyshev C) with coefficients given in A187360. This is obtained from the factorization into Psi polynomials (see the Jul 12 2011 comment above) but written in terms of minimal polynomials of 2*cos(2*Pi/n) with coefficients in A232624:
S(2*k, x) = Product_{2 <= d | (2*k+1)} C(d, x)*(-1)^deg(d)*C(d, -x), with deg(d) = A055034(d) the degree of C(d, x).
S(2*k+1, x) = Product_{2 <= d | 2*(k+1)} C(d, x) * Product_{3 <= 2*d + 1 | (k+1)} (-1)^(deg(2*d+1))*C(2*d+1, -x).
Note that (-1)^(deg(2*d+1))*C(2*d+1, -x)*C(2*d+1, x) pairs always appear.
The number of C factors of S(2*k, x), for k >= 0, is 2*(tau(2*k+1) - 1) = 2*(A099774(k+1) - 1) = 2*A095374(k), and for S(2*k+1, x), for k >= 0, it is tau(2*(k+1)) + tau_{odd}(k+1) - 2 = A302707(k), with tau(2*k+1) = A099774(k+1), tau(n) = A000005 and tau(2*(k+1)) = A099777(k+1).
For the reverse problem, the factorization of C polynomials into S polynomials, see A255237. (End)
The S polynomials with general initial conditions S(a,b;n,x) = x*S(a,b;n-1,x) - S(a,b;n-2,x), for n >= 1, with S(a,b;-1,x) = a and S(a,b;0,x) = b are S(a,b;n,x) = b*S(n, x) - a*S(n-1, x), for n >= -1. Recall that S(-2, x) = -1 and S(-1, x) = 0. The o.g.f. is G(a,b;z,x) = (b - a*z)/(1 - x*z + z^2). - Wolfdieter Lang, Oct 18 2019
Also the convolution triangle of A101455. - Peter Luschny, Oct 06 2022
From Wolfdieter Lang, Apr 26 2023: (Start)
Multi-section of S-polynomials: S(m*n+k, x) = S(m+k, x)*S(n-1, R(m, x)) - S(k, x)*S(n-2, R(m, x)), with R(n, x) = S(n, x) - S(n-2, x) (see A127672), S(-2, x) = -1, and S(-1, x) = 0, for n >= 0, m >= 1, and k = 0, 1, ..., m-1.
O.g.f. of {S(m*n+k, y)}_{n>=0}: G(m,k,y,x) = (S(k, y) - (S(k, y)*R(m, y) - S(m+k, y))*x)/(1 - R(m,y)*x + x^2).
See eqs. (40) and (49), with r = x or y and s =-1, of the G. Detlefs and W. Lang link at A034807. (End)
S(n, x) for complex n and complex x: S(n, x) = ((-i/2)/sqrt(1 - (x/2)^2))*(q(x/2)*exp(+n*log(q(x/2))) - (1/q(x/2))*exp(-n*log(q(x/2)))), with q(x) = x + sqrt(1 - x^2)*i. Here log(z) = |z| + Arg(z)*i, with Arg(z) from [-Pi,+Pi) (principal branch). This satisfies the recurrence relation for S because it is derived from the Binet - de Moivre formula for S. Examples: S(n/m, 0) = cos((n/m)*Pi/4), for n >= 0 and m >= 1. S(n*i, 0) = (1/2)*(1 + exp(n*Pi))*exp(-(n/2)*Pi), for n >= 0. S(1+i, 2+i) = 0.6397424847... + 1.0355669490...*i. Thanks to Roberto Alfano for asking a question leading to this formula. - Wolfdieter Lang, Jun 05 2023
Lim_{n->oo} S(n, x)/S(n-1, x) = r(x) = (x - sqrt(x^2 -4))/2, for |x| >= 2. For x = +-2, this limit is +-1. - Wolfdieter Lang, Nov 15 2023

			The triangle T(n, k) begins:
  n\k  0  1   2   3   4   5   6    7   8   9  10  11
  0:   1
  1:   0  1
  2:  -1  0   1
  3:   0 -2   0   1
  4:   1  0  -3   0   1
  5:   0  3   0  -4   0   1
  6:  -1  0   6   0  -5   0   1
  7:   0 -4   0  10   0  -6   0    1
  8:   1  0 -10   0  15   0  -7    0   1
  9:   0  5   0 -20   0  21   0   -8   0   1
  10: -1  0  15   0 -35   0  28    0  -9   0   1
  11:  0 -6   0  35   0 -56   0   36   0 -10   0   1
  ... Reformatted and extended by _Wolfdieter Lang_, Oct 24 2012
For more rows see the link.
E.g., fourth row {0,-2,0,1} corresponds to polynomial S(3,x)= -2*x + x^3.
From _Wolfdieter Lang_, Jul 12 2011: (Start)
Zeros of S(3,x) with rho(4)= 2*cos(Pi/4) = sqrt(2):
  +- t(1,sqrt(2)) = +- sqrt(2) and
  +- t(2,sqrt(2)) = +- 0.
Factorization of S(3,x) in terms of Psi polynomials:
S(3,x) = (2^3)*Psi(4,x/2)*Psi(8,x/2) = x*(x^2-2).
(End)
From _Wolfdieter Lang_, Nov 04 2011: (Start)
A- and Z- sequence recurrence:
T(4,0) = - (C(0)*T(3,1) + C(1)*T(3,3)) = -(-2 + 1) = +1,
T(5,3) = -3 - 1*1 = -4.
(End)
Boas-Buck recurrence for column k = 2, n = 6: S(6, 2) = (3/4)*(0 - 2* S(4 ,2) + 0 + 2*S(2, 2)) = (3/4)*(-2*(-3) + 2) = 6. - _Wolfdieter Lang_, Aug 11 2017
From _Wolfdieter Lang_, Apr 12 2018: (Start)
Factorization into C polynomials (see the Apr 12 2018 comment):
S(4, x) = 1 - 3*x^2 + x^4 = (-1 + x + x^2)*(-1 - x + x^2) = (-C(5, -x)) * C(5, x); the number of factors is 2 = 2*A095374(2).
S(5, x) = 3*x - 4*x^3 + x^5 = x*(-1 + x)*(1 + x)*(-3 + x^2) = C(2, x)*C(3, x)*(-C(3, -x))*C(6, x); the number of factors is 4 = A302707(2). (End)

G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, p. 164.
Max Koecher and Aloys Krieg, Elliptische Funktionen und Modulformen, 2. Auflage, Springer, 2007, p. 223.
Franz Lemmermeyer, Reciprocity Laws. From Euler to Eisenstein, Springer, 2000.
D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 232, Sect. 3.3.38.
Theodore J. Rivlin, Chebyshev polynomials: from approximation theory to algebra and number theory, 2. ed., Wiley, New York, 1990, pp. 60 - 61.
R. Vein and P. Dale, Determinants and Their Applications in Mathematical Physics, Springer, 1999.

T. D. Noe, Rows 0 to 100 of the triangle, flattened.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy], Table 22.8, p.797.
J. Allouche and G. Skordev, Schur congruences, Carlitz sequences of polynomials and automaticity, Discrete Mathematics, Vol. 214, Issue 1-3, 21 March 2000, p.21-49.
T. Amdeberhan, X. Chen, V. Moll, and B. Sagan, Generalized Fibonacci polynomials and Fibonomial coefficients, arXiv preprint arXiv:1306.6511 [math.CO], 2013.
Paul Barry, Symmetric Third-Order Recurring Sequences, Chebyshev Polynomials, and Riordan Arrays, JIS 12 (2009) 09.8.6.
Paul Barry, On the inversion of Riordan arrays, arXiv:2101.06713 [math.CO], 2021.
Paul Barry and A. Hennessy, Meixner-Type Results for Riordan Arrays and Associated Integer Sequences, J. Int. Seq. 13 (2010) # 10.9.4, section 5.
C. Beck, Spatio-temporal Chaos and Vacuum Fluctuations of Quantized Fields , arXiv preprint arXiv:0207081 [hep-th], 2002.
Alexander Burstein and Louis W. Shapiro, Pseudo-involutions in the Riordan group, arXiv:2112.11595 [math.CO], 2021.
Tom Copeland, Addendum to Elliptic Lie Triad
Jerry Ray Dias, Properties and relationships of conjugated polyenes having a reciprocal eigenvalue spectrum - dendralene and radialene hydrocarbons, Croatica Chem. Acta, 77 (2004), 325-330. [p. 328].
S. R. Finch, P. Sebah and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle, arXiv:0802.2654 [math.NT], 2008.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
M. Ismail, One parameter generalizations of the Fibonacci and Lucas numbers, arXiv preprint arXiv:0606743v1 [math.CA], 2006.
Wolfdieter Lang, First rows of the triangle.
Wolfdieter Lang, Chebyshev S-polynomials: ten applications.
Wolfdieter Lang, The field Q(2cos(pi/n)), its Galois group and length ratios in the regular n-gon, arXiv:1210.1018 [math.GR], 2012-2017.
R. Sazdanovic, A categorification of the polynomial ring, slide presentation, 2011. [From _Tom Copeland_, Dec 27 2015]
P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
T. Sunada, Discrete Geometric Analysis, 2008.
Eric Weisstein's World of Mathematics, Adjacency Matrix, Characteristic Polynomial, Chebyshev Polynomial of the Second Kind, Fibonacci Polynomial, Matching Polynomial, and Path Graph
Index entries for sequences related to Chebyshev polynomials.
Index entries for "core" sequences

Cf. A000005, A000217, A000292, A000332, A000389, A001227, A007318, A008611, A008615, A101455, A010892, A011973, A053112 (without zeros), A053117, A053119 (reflection), A053121 (inverse triangle), A055034, A097610, A099774, A099777, A100258, A112552 (first column clipped), A127672, A168561 (absolute values), A187360. A194960, A232624, A255237.

Triangles of coefficients of Chebyshev's S(n,x+k) for k = 5, 4, 3, 2, 1, 0, -1, -2, -3, -4, -5: A207824, A207823, A125662, A078812, A101950, A049310, A104562, A053122, A207815, A159764, A123967.

A049310:= func< n,k | ((n+k) mod 2) eq 0 select (-1)^(Floor((n+k)/2)+k)*Binomial(Floor((n+k)/2), k) else 0 >;
[A049310(n,k): k in [0..n], n in [0..15]]; // G. C. Greubel, Jul 25 2022

A049310 := proc(n,k): binomial((n+k)/2,(n-k)/2)*cos(Pi*(n-k)/2)*(1+(-1)^(n-k))/2 end: seq(seq(A049310(n,k), k=0..n),n=0..11); # Johannes W. Meijer, Aug 08 2011
# Uses function PMatrix from A357368. Adds a row above and a column to the left.
PMatrix(10, n -> ifelse(irem(n, 2) = 0, 0, (-1)^iquo(n-1, 2))); # Peter Luschny, Oct 06 2022

t[n_, k_] /; EvenQ[n+k] = ((-1)^((n+k)/2+k))*Binomial[(n+k)/2, k]; t[n_, k_] /; OddQ[n+k] = 0; Flatten[Table[t[n, k], {n, 0, 12}, {k, 0, n}]][[;; 86]] (* Jean-François Alcover, Jul 05 2011 *)
Table[Coefficient[(-I)^n Fibonacci[n + 1, - I x], x, k], {n, 0, 10}, {k, 0, n}] //Flatten (* Clark Kimberling, Aug 02 2011; corrected by Eric W. Weisstein, Apr 06 2017 *)
CoefficientList[ChebyshevU[Range[0, 10], -x/2], x] // Flatten (* Eric W. Weisstein, Apr 06 2017 *)
CoefficientList[Table[(-I)^n Fibonacci[n + 1, -I x], {n, 0, 10}], x] // Flatten (* Eric W. Weisstein, Apr 06 2017 *)

{T(n, k) = if( k<0 || k>n || (n + k)%2, 0, (-1)^((n + k)/2 + k) * binomial((n + k)/2, k))} /* Michael Somos, Jun 24 2002 */

@CachedFunction
def A049310(n,k):
    if n< 0: return 0
    if n==0: return 1 if k == 0 else 0
    return A049310(n-1,k-1) - A049310(n-2,k)
for n in (0..9): [A049310(n,k) for k in (0..n)] # Peter Luschny, Nov 20 2012

T(n,k) := 0 if n < k or n+k odd, otherwise ((-1)^((n+k)/2+k))*binomial((n+k)/2, k); T(n, k) = -T(n-2, k)+T(n-1, k-1), T(n, -1) := 0 =: T(-1, k), T(0, 0)=1, T(n, k)= 0 if n < k or n+k odd; g.f. k-th column: (1 / (1 + x^2)^(k + 1)) * x^k. - Michael Somos, Jun 24 2002
T(n,k) = binomial((n+k)/2, (n-k)/2)*cos(Pi*(n-k)/2)*(1+(-1)^(n-k))/2. - Paul Barry, Aug 28 2005
Sum_{k=0..n} T(n,k)^2 = A051286(n). - Philippe Deléham, Nov 21 2005
Recurrence for the (unsigned) Fibonacci polynomials: F(1)=1, F(2)=x; for n > 2, F(n) = x*F(n-1) + F(n-2).
From Wolfdieter Lang, Nov 04 2011: (Start)
The Riordan A- and Z-sequences, given in a comment above, lead together to the recurrence:
T(n,k) = 0 if n < k, if k=0 then T(0,0)=1 and
  T(n,0)= -Sum_{i=0..floor((n-1)/2)} C(i)*T(n-1,2*i+1), otherwise T(n,k) = T(n-1,k-1) - Sum_{i=1..floor((n-k)/2)} C(i)*T(n-1,k-1+2*i), with the Catalan numbers C(n)=A000108(n).
(End)
The row polynomials satisfy also S(n,x) = 2*(T(n+2, x/2) - T(n, x/2))/(x^2-4) with the Chebyshev T-polynomials. Proof: Use the trace formula 2*T(n, x/2) = S(n, x) - S(n-2, x) (see the Dec 02 2010 comment above) and the S-recurrence several times. This is a formula which expresses the S- in terms of the T-polynomials. - Wolfdieter Lang, Aug 07 2014
From Tom Copeland, Dec 06 2015: (Start)
The non-vanishing, unsigned subdiagonals Diag_(2n) contain the elements D(n,k) = Sum_{j=0..k} D(n-1,j) = (k+1) (k+2) ... (k+n) / n! = binomial(n+k,n), so the o.g.f. for the subdiagonal is (1-x)^(-(n+1)). E.g., Diag_4 contains D(2,3) = D(1,0) + D(1,1) + D(1,2) + D(1,3) = 1 + 2 + 3 + 4 = 10 = binomial(5,2). Diag_4 is shifted A000217; Diag_6, shifted A000292: Diag_8, shifted A000332; and Diag_10, A000389.
The non-vanishing antidiagonals are signed rows of the Pascal triangle A007318.
For a reversed, unsigned version with the zeros removed, see A011973. (End)
The Boas-Buck recurrence (see a comment above) for the sequence of column k is: S(n, k) = ((k+1)/(n-k))*Sum_{p=0..n-1-k} (1 - (-1)^p)*(-1)^((p+1)/2) * S(n-1-p, k), for n > k >= 0 and input S(k, k) = 1. - Wolfdieter Lang, Aug 11 2017
The m-th row consecutive nonzero entries in order are (-1)^c*(c+b)!/c!b! with c = m/2, m/2-1, ..., 0 and b = m-2c if m is even and with c = (m-1)/2, (m-1)/2-1, ..., 0 with b = m-2c if m is odd. For the 8th row starting at a(36) the 5 consecutive nonzero entries in order are 1,-10,15,-7,1 given by c = 4,3,2,1,0 and b = 0,2,4,6,8. - Richard Turk, Aug 20 2017
O.g.f.: exp( Sum_{n >= 0} 2*T(n,x/2)*t^n/n ) = 1 + x*t + (-1 + x^2)*t^2 + (-2*x + x^3)*t^3 + (1 - 3*x^2 + x^4)*t^4 + ..., where T(n,x) denotes the n-th Chebyshev polynomial of the first kind. - Peter Bala, Aug 15 2022

A109466 Riordan array (1, x(1-x)).

Original entry on oeis.org

1, 0, 1, 0, -1, 1, 0, 0, -2, 1, 0, 0, 1, -3, 1, 0, 0, 0, 3, -4, 1, 0, 0, 0, -1, 6, -5, 1, 0, 0, 0, 0, -4, 10, -6, 1, 0, 0, 0, 0, 1, -10, 15, -7, 1, 0, 0, 0, 0, 0, 5, -20, 21, -8, 1, 0, 0, 0, 0, 0, -1, 15, -35, 28, -9, 1, 0, 0, 0, 0, 0, 0, -6, 35, -56, 36, -10, 1, 0, 0, 0, 0, 0, 0, 1, -21, 70, -84, 45, -11, 1, 0, 0, 0, 0

Offset: 0

Philippe Deléham, Aug 28 2005

Inverse is Riordan array (1, xc(x)) (A106566).
Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, -1, 1, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.
Modulo 2, this sequence gives A106344. - Philippe Deléham, Dec 18 2008
Coefficient array of the polynomials Chebyshev_U(n, sqrt(x)/2)*(sqrt(x))^n. - Paul Barry, Sep 28 2009

			Rows begin:
  1;
  0,  1;
  0, -1,  1;
  0,  0, -2,  1;
  0,  0,  1, -3,  1;
  0,  0,  0,  3, -4,   1;
  0,  0,  0, -1,  6,  -5,   1;
  0,  0,  0,  0, -4,  10,  -6,   1;
  0,  0,  0,  0,  1, -10,  15,  -7,  1;
  0,  0,  0,  0,  0,   5, -20,  21, -8,  1;
  0,  0,  0,  0,  0,  -1,  15, -35, 28, -9, 1;
From _Paul Barry_, Sep 28 2009: (Start)
Production array is
  0,    1,
  0,   -1,    1,
  0,   -1,   -1,   1,
  0,   -2,   -1,  -1,   1,
  0,   -5,   -2,  -1,  -1,  1,
  0,  -14,   -5,  -2,  -1, -1,  1,
  0,  -42,  -14,  -5,  -2, -1, -1,  1,
  0, -132,  -42, -14,  -5, -2, -1, -1,  1,
  0, -429, -132, -42, -14, -5, -2, -1, -1, 1 (End)

Paul Barry, Embedding structures associated with Riordan arrays and moment matrices, arXiv preprint arXiv:1312.0583 [math.CO], 2013.
Tom Copeland, Addendum to Elliptic Lie Triad

Cf. A026729 (unsigned version), A000108, A030528, A124644.

/* As triangle */ [[(-1)^(n-k)*Binomial(k, n-k): k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Jan 14 2016

(* The function RiordanArray is defined in A256893. *)
RiordanArray[1&, #(1-#)&, 13] // Flatten (* Jean-François Alcover, Jul 16 2019 *)

Number triangle T(n, k) = (-1)^(n-k)*binomial(k, n-k).
T(n, k)*2^(n-k) = A110509(n, k); T(n, k)*3^(n-k) = A110517(n, k).
Sum_{k=0..n} T(n,k)*A000108(k)=1. - Philippe Deléham, Jun 11 2007
From Philippe Deléham, Oct 30 2008: (Start)
Sum_{k=0..n} T(n,k)*A144706(k) = A082505(n+1).
Sum_{k=0..n} T(n,k)*A002450(k) = A100335(n).
Sum_{k=0..n} T(n,k)*A001906(k) = A100334(n).
Sum_{k=0..n} T(n,k)*A015565(k) = A099322(n).
Sum_{k=0..n} T(n,k)*A003462(k) = A106233(n). (End)
Sum_{k=0..n} T(n,k)*x^(n-k) = A053404(n), A015447(n), A015446(n), A015445(n), A015443(n), A015442(n), A015441(n), A015440(n), A006131(n), A006130(n), A001045(n+1), A000045(n+1), A000012(n), A010892(n), A107920(n+1), A106852(n), A106853(n), A106854(n), A145934(n), A145976(n), A145978(n), A146078(n), A146080(n), A146083(n), A146084(n) for x = -12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8,9,10,11,12 respectively. - Philippe Deléham, Oct 27 2008
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A010892(n), A099087(n), A057083(n), A001787(n+1), A030191(n), A030192(n), A030240(n), A057084(n), A057085(n+1), A057086(n) for x = 0,1,2,3,4,5,6,7,8,9,10 respectively. - Philippe Deléham, Oct 28 2008
G.f.: 1/(1-y*x+y*x^2). - Philippe Deléham, Dec 15 2011
T(n,k) = T(n-1,k-1) - T(n-2,k-1), T(n,0) = 0^n. - Philippe Deléham, Feb 15 2012
Sum_{k=0..n} T(n,k)*x^(n-k) = F(n+1,-x) where F(n,x)is the n-th Fibonacci polynomial in x defined in A011973. - Philippe Deléham, Feb 22 2013
Sum_{k=0..n} T(n,k)^2 = A051286(n). - Philippe Deléham, Feb 26 2013
Sum_{k=0..n} T(n,k)*T(n+1,k) = -A110320(n). - Philippe Deléham, Feb 26 2013
For T(0,0) = 0, the signed triangle below has the o.g.f. G(x,t) = [t*x(1-x)]/[1-t*x(1-x)] = L[t*Cinv(x)] where L(x) = x/(1-x) and Cinv(x)=x(1-x) with the inverses Linv(x) = x/(1+x) and C(x)= [1-sqrt(1-4*x)]/2, an o.g.f. for the shifted Catalan numbers A000108, so the inverse o.g.f. is Ginv(x,t) = C[Linv(x)/t] = [1-sqrt[1-4*x/(t(1+x))]]/2 (cf. A124644 and A030528). - Tom Copeland, Jan 19 2016

A168561 Riordan array (1/(1-x^2), x/(1-x^2)). Unsigned version of A049310.

Original entry on oeis.org

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, 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, 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, 45, 0, 11, 0, 1

Offset: 0

Philippe Deléham, Nov 29 2009

Row sums: A000045(n+1), Fibonacci numbers.
A168561*A007318 = A037027, as lower triangular matrices. Diagonal sums : A077957. - Philippe Deléham, Dec 02 2009
T(n,k) is the number of compositions of n+1 into k+1 odd parts. Example: T(4,2)=3 because we have 5 = 1+1+3 = 1+3+1 = 3+1+1.
Coefficients of monic Fibonacci polynomials (rising powers of x). Ftilde(n, x) = x*Ftilde(n-1, x) + Ftilde(n-2, x), n >=0, Ftilde(-1,x) = 0, Ftilde(0, x) = 1. G.f.: 1/(1 - x*z - z^2). Compare with Chebyshev S-polynomials (A049310). - Wolfdieter Lang, Jul 29 2014

			The triangle T(n,k) begins:
n\k 0  1   2   3   4    5    6    7    8    9  10  11  12  13 14 15 ...
0:  1
1:  0  1
2:  1  0   1
3:  0  2   0   1
4:  1  0   3   0   1
5:  0  3   0   4   0    1
6:  1  0   6   0   5    0    1
7:  0  4   0  10   0    6    0    1
8:  1  0  10   0  15    0    7    0    1
9:  0  5   0  20   0   21    0    8    0    1
10: 1  0  15   0  35    0   28    0    9    0   1
11: 0  6   0  35   0   56    0   36    0   10   0   1
12: 1  0  21   0  70    0   84    0   45    0  11   0   1
13: 0  7   0  56   0  126    0  120    0   55   0  12   0   1
14: 1  0  28   0 126    0  210    0  165    0  66   0  13   0  1
15: 0  8   0  84   0  252    0  330    0  220   0  78   0  14  0  1
... reformatted by _Wolfdieter Lang_, Jul 29 2014.
------------------------------------------------------------------------

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
J.-P. Allouche and M. Mendès France, Stern-Brocot polynomials and power series, arXiv preprint arXiv:1202.0211 [math.NT], 2012. - From _N. J. A. Sloane_, May 10 2012
Tom Copeland, Addendum to Elliptic Lie Triad
Milan Janjić, Words and Linear Recurrences, J. Int. Seq. 21 (2018), #18.1.4.

Cf. A162515 (rows reversed), A112552, A102426 (deflated).

A168561:=proc(n,k) if n-k mod 2 = 0 then binomial((n+k)/2,k) else 0 fi end proc:
seq(seq(A168561(n,k),k=0..n),n=0..12) ; # yields sequence in triangular form

Table[If[EvenQ[n + k], Binomial[(n + k)/2, k], 0], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Apr 16 2017 *)

T(n,k) = if ((n+k) % 2, 0, binomial((n+k)/2,k));
tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n,k), ", ")); print();); \\ Michel Marcus, Oct 09 2016

Sum_{k=0..n} T(n,k)*x^k = A059841(n), A000045(n+1), A000129(n+1), A006190(n+1), A001076(n+1), A052918(n), A005668(n+1), A054413(n), A041025(n), A099371(n+1), A041041(n), A049666(n+1), A041061(n), A140455(n+1), A041085(n), A154597(n+1), A041113(n) for x = 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 respectively. - Philippe Deléham, Dec 02 2009
T(2n,2k) = A085478(n,k). T(2n+1,2k+1) = A078812(n,k). Sum_{k=0..n} T(n,k)*x^(n-k) = A000012(n), A000045(n+1), A006131(n), A015445(n), A168579(n), A122999(n) for x = 0,1,2,3,4,5 respectively. - Philippe Deléham, Dec 02 2009
T(n,k) = binomial((n+k)/2,k) if (n+k) is even; otherwise T(n,k)=0.
G.f.: (1-z^2)/(1-t*z-z^2) if offset is 1.
T(n,k) = T(n-1,k-1) + T(n-2,k), T(0,0) = 1, T(0,1) = 0. - Philippe Deléham, Feb 09 2012
Sum_{k=0..n} T(n,k)^2 = A051286(n). - Philippe Deléham, Feb 09 2012
From R. J. Mathar, Feb 04 2022: (Start)
Sum_{k=0..n} T(n,k)*k = A001629(n+1).
Sum_{k=0..n} T(n,k)*k^2 = 0,1,4,11,... = 2*A055243(n)-A099920(n+1).
Sum_{k=0..n} T(n,k)*k^3 = 0,1,8,29,88,236,... = 12*A055243(n) -6*A001629(n+2) +A001629(n+1)-6*(A001872(n)-2*A001872(n-1)). (End)

Typo in name corrected (1(1-x^2) changed to 1/(1-x^2)) by Wolfdieter Lang, Nov 20 2010

A108479 Antidiagonal sums of number triangle A086645.

Original entry on oeis.org

1, 1, 2, 7, 17, 44, 117, 305, 798, 2091, 5473, 14328, 37513, 98209, 257114, 673135, 1762289, 4613732, 12078909, 31622993, 82790070, 216747219, 567451585, 1485607536, 3889371025, 10182505537, 26658145586, 69791931223, 182717648081

Offset: 0

Paul Barry, Jun 04 2005

Seiichi Manyama, Table of n, a(n) for n = 0..5000
Index entries for linear recurrences with constant coefficients, signature (2,1,2,-1).

Cf. A005252, A051286, A086645, A182890.
Cf. A381421, A382230, A382470, A382471, A382472, A382473, A382474.
Cf. A376729, A376730, A376731.

LinearRecurrence[{2,1,2,-1},{1,1,2,7},30] (* Harvey P. Dale, Jun 01 2021 *)

G.f.: (1 - x - x^2)/(1 - 2*x - x^2 - 2*x^3 + x^4).
a(n) = 2*(n-1) + a(n-2) + 2*a(n-3) - a(n-4).
a(n) = Sum_{k=0..floor(n/2)} C(2*(n-k), 2*k).
a(n) = Sum_{k=0..floor(n/2)} Sum_{j=0..n-k} C(2*(n-2*k), j) * C(2*k, j).
a(n) = A005252(2*n). - Seiichi Manyama, Aug 11 2024

A110320 Number of blocks in all RNA secondary structures with n nodes (an RNA secondary structure can be viewed as a restricted noncrossing partition).

Original entry on oeis.org

1, 2, 5, 13, 32, 80, 201, 505, 1273, 3217, 8146, 20668, 52531, 133726, 340909, 870213, 2223958, 5689807, 14571335, 37350585, 95821071, 246015677, 632088930, 1625119218, 4180845277, 10762096850, 27718352411, 71426753423, 184146711578

Offset: 1

Emeric Deutsch, Jul 19 2005

nonn

Antidiagonal sums of A132812. - Philippe Deléham, Jun 08 2013

			a(4)=13 because the 4 (=A004148(4)) RNA secondary structures of size 4, namely 1/2/3/4, 13/2/4, 14/2/3 and 1/24/3, have altogether 4+3+3+3=13 blocks.

G. C. Greubel, Table of n, a(n) for n = 1..1000
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, and Vincent Vajnovszki, Grand Dyck paths with air pockets, arXiv:2211.04914 [math.CO], 2022.
Paul Barry, Jacobsthal Decompositions of Pascal's Triangle, Ternary Trees, and Alternating Sign Matrices, Journal of Integer Sequences, 19, 2016, #16.3.5.
Peter McCalla and Asamoah Nkwanta, Catalan and Motzkin Integral Representations, arXiv:1901.07092 [math.NT], 2019.
W. R. Schmitt and M. S. Waterman, Linear trees and RNA secondary structure, Discrete Appl. Math., 51, 317-323, 1994.
P. R. Stein and M. S. Waterman, On some new sequences generalizing the Catalan and Motzkin numbers, Discrete Math., 26 (1978), 261-272.
M. Vauchassade de Chaumont and G. Viennot, Polynomes orthogonaux et problèmes d'énumeration en biologie moléculaire, Publ. I.R.M.A. Strasbourg, 1984, 229/S-08, Actes 8e Sem. Lotharingien, pp. 79-86.

Cf. A004148, A110319.

G:=1/2*(1-z-z^2)/z^2/(1-2*z-z^2-2*z^3+z^4)^(1/2)-1/2*1/(z^2): Gser:=series(G,z=0,37): seq(coeff(Gser,z^n),n=1..33);

Table[Sum[Binomial[n-j+1,j]Binomial[n-j+1,j-1],{j, 0, n}],{n,1,25}] (* Benedict W. J. Irwin, Sep 24 2016 *)

G.f.: (1-z-z^2)/(2*z^2*sqrt(1-2*z-z^2-2*z^3+z^4))-1/(2*z^2).
a(n) = Sum_{k=1..n} k*A110319(n,k).
Conjecture: a(n) = (A051292(n+2)-A051286(n+1))/2. - Gerald McGarvey, Jan 14 2007
a(n) = (A051286(n+2)-A051286(n+1)-A051286(n))/2. - Benedict W. J. Irwin, Sep 24 2016
a(n) ~ sqrt(4 + 9/sqrt(5)) * (3+sqrt(5))^n / (sqrt(Pi*n) * 2^(n+1)). - Vaclav Kotesovec, Sep 25 2016, equivalently, a(n) ~ phi^(2*n + 3) / (2 * 5^(1/4) * sqrt(Pi*n)), where phi = A001622 is the golden ratio. - Vaclav Kotesovec, Dec 06 2021
D-finite with recurrence (n+2)*a(n) +3*(-n-1)*a(n-1) +(n-7)*a(n-3) +2*(2*n-3)*a(n-4) +(n-5)*a(n-5) +(-n+4)*a(n-6)=0. - R. J. Mathar, Feb 21 2020

A181545 G.f.: A(x) = Sum_{n>=0} (3n)!/(n!)^3 * x^(3n)/(1-x-x^2)^(3n+1).

Original entry on oeis.org

1, 1, 2, 9, 29, 92, 343, 1281, 4720, 17899, 68933, 266364, 1037423, 4072439, 16065148, 63658521, 253356763, 1012049086, 4055596343, 16299779331, 65683233938, 265310551667, 1073968967929, 4355988107100, 17699727361051

Offset: 0

Paul D. Hanna, Oct 29 2010

nonn

Limit_{n->oo} a(n+1)/a(n) = (Fibonacci(3)*sqrt(5) + Lucas(3))/2 = sqrt(5) + 2.

Diagonal of the rational function 1 / ((1 - x)*(1 - y)*(1 - z) - (x*y*z)^2). - Ilya Gutkovskiy, Apr 23 2025

			G.f. A(x) = 1 + x + 2*x^2 + 9*x^3 + 29*x^4 + 92*x^5 + 343*x^6 + ...
which equals the series:
A(x) = 1/(1-x-x^2) + 3!/1!^3*x^3/(1-x-x^2)^4 + 6!/2!^3*x^6/(1-x-x^2)^7 + 9!/3!^3*x^9/(1-x-x^2)^10 + 12!/4!^3*x^12/(1-x-x^2)^13 + ...
The g.f. also equals the series:
A(x) = 1 +
x*(1 + x) +
x^2*(1 + 2^3*x + x^2) +
x^3*(1 + 3^3*x + 3^3*x^2 + x^3) +
x^4*(1 + 4^3*x + 6^3*x^2 + 4^3*x^3 + x^4) +
x^5*(1 + 5^3*x + 10^3*x^2 + 10^3*x^3 + 5^3*x^4 + x^5) + ...
The terms begin:
a(0) = a(1) = 1^3;
a(2) = 1^3 + 1^3 = 2;
a(3) = 1^3 + 2^3 = 9;
a(4) = 1^3 + 3^3 + 1^3 = 29;
a(5) = 1^3 + 4^3 + 3^3 = 92;
a(6) = 1^3 + 5^3 + 6^3 + 1^3 = 343;
a(7) = 1^3 + 6^3 + 10^3 + 4^3 = 1281; ...

Iain Fox, Table of n, a(n) for n = 0..1600
C. Banderier, P. Hitczenko, Enumeration and asymptotics of restricted compositions having the same number of parts, Disc. Appl. Math. 160 (18) (2012) 2542-2554. Proposition 3.1.
Steffen Eger, On the Number of Many-to-Many Alignments of N Sequences, arXiv:1511.00622 [math.CO], 2015.
Edyta Hetmaniok, Barbara Smoleń, Roman Wituła, The Stirling triangles, Proceedings of the Symposium for Young Scientists in Technology, Engineering and Mathematics (SYSTEM 2017), Kaunas, Lithuania, April 28, 2017, p. 35-41.

Cf. A006480, A217421, A181546, A051286.

Table[Sum[Binomial[n-k,k]^3,{k,0,Floor[n/2]}],{n,0,20}] (* Vaclav Kotesovec, Jul 31 2014 *)

PARI
```
{a(n)=sum(k=0,n\2,binomial(n-k,k)^3)}
```

{a(n)=polcoeff(sum(m=0, n+1, x^m*sum(k=0, m, binomial(m, k)^3*x^k + x*O(x^n))), n)}

{a(n)=polcoeff(sum(m=0,n,x^(3*m)/(1-x-x^2+x*O(x^n))^(3*m+1)*(3*m)!/(m!)^3),n)}

a(n) = Sum_{k=0..floor(n/2)} binomial(n-k,k)^3.
G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} binomial(n,k)^3 * x^k.
G.f.: A(x) = G( x^3/(1-x-x^2)^3 )/(1-x-x^2) where G(x) satisfies:
* G(x^3) = G( x*(1+3*x+9*x^2)/(1+6*x)^3 )/(1+6*x)
and G(x) is the g.f. of A006480.
Recurrence: (n-3)*n^2*a(n) = (n-3)*(3*n^2 - 3*n + 1)*a(n-1) - (n-1)*a(n-2) + 2*(n-2)*(11*n^2 - 44*n + 34)*a(n-3) + (n-3)*a(n-4) + (n-1)*(3*n^2 - 21*n + 37)*a(n-5) + (n-4)^2*(n-1)*a(n-6). - Vaclav Kotesovec, Jul 31 2014
a(n) ~ sqrt((9+4*sqrt(5))/12) * (2+sqrt(5))^n / (Pi*n). - Vaclav Kotesovec, Jul 31 2014
Equivalently, a(n) ~ phi^(3*n + 3) / (2*sqrt(3)*Pi*n), where phi = A001622 is the golden ratio. - Vaclav Kotesovec, Dec 08 2021

A199847 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous.

Original entry on oeis.org

1, 1, 2, 1, 3, 5, 1, 4, 8, 11, 1, 5, 13, 23, 26, 1, 6, 18, 42, 66, 63, 1, 7, 25, 68, 132, 192, 153, 1, 8, 32, 103, 239, 428, 575, 376, 1, 9, 41, 149, 399, 845, 1393, 1739, 931, 1, 10, 50, 206, 630, 1532, 2958, 4561, 5307, 2317, 1, 11, 61, 276, 944, 2600, 5754, 10349, 15032

Offset: 1

R. H. Hardin Nov 11 2011

Table starts
....1.....1.....1......1......1......1.......1.......1.......1.......1........1
....2.....3.....4......5......6......7.......8.......9......10......11.......12
....5.....8....13.....18.....25.....32......41......50......61......72.......85
...11....23....42.....68....103....149.....206.....276.....361.....461......578
...26....66...132....239....399....630.....944....1367....1913....2612.....3482
...63...192...428....845...1532...2600....4188....6465....9634...13932....19636
..153...575..1393...2958...5754..10426...17879...29268...46126...70322...104253
..376..1739..4561..10349..21383..41079...74424..128462..212862..340592...528705
..931..5307.15032..36111..78735.159330..303400..549404..953172.1594101..2581937
.2317.16304.49889.126121.288580.611698.1218440.2304210.4169150.7260993.12230924

			Some solutions for n=7 k=6
..5....4....2....2....6....5....2...-1....3....3....6....4....6....6....5....3
..4....2....1....3....6....2....1....0....3....1....3....1....6....1....5...-1
..1....2....1....3....0....3....1....1...-1....1....4....1...-2....1...-1...-1
..0...-1...-1....0...-4...-2....1....0....0...-1....1....2...-2....1...-3....0
.-2....0...-2...-1...-3...-3....1....1....1...-1...-2....2...-2....0...-3...-1
.-2...-1...-1...-1...-2...-3....0....0....0....0...-6...-5...-3...-3...-2....0
.-6...-6....0...-6...-3...-2...-6...-1...-6...-3...-6...-5...-3...-6...-1....0

R. H. Hardin, Table of n, a(n) for n = 1..958

Column 1 is A051286

Row 3 is A000982(n+2)

A051292 Whitney number of level n of the lattice of the ideals of the crown of size 2 n.

Original entry on oeis.org

2, 1, 1, 4, 9, 21, 52, 127, 313, 778, 1941, 4863, 12228, 30837, 77967, 197574, 501657, 1275987, 3250618, 8292703, 21182509, 54169966, 138674031, 355343469, 911347684, 2339226871, 6008781637, 15445521202, 39728258103, 102248793573, 263306364822, 678411876729, 1748800672089

Offset: 0

Emanuele Munarini

A Chebyshev transform of the central binomial numbers A002426 under the mapping that takes g(x) to ((1-x^2)/(1+x^2))g(x/(1+x^2)). Starts 1,1,1,4,9,21,... - Paul Barry, Jan 31 2005

This is the second kind of Whitney numbers, which count elements, not to be confused with the first kind, which sum Mobius functions. - Thomas Zaslavsky, May 07 2008

			a(3) = 4 because the ideals of size 3 of the crown C(3) = { x1 < x2 > x3 < x4 > x5 < x6 > x1 } are x1*x2*x3, x3*x4*x5, x1*x6*x5, x1*x3*x5.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Alessandro Conflitti, On Whitney numbers of the Order Ideals of Generalized Fences and Crowns, arXiv:math/0505636 [math.CO], 2005.
E. Munarini, N. Zagaglia Salvi, On the Rank Polynomial of the Lattice of Order Ideals of Fences and Crowns, Discrete Mathematics 259 (2002), 163-177.

Cf. A051291, A051286. Main diagonal of A205810.

f:= gfun:-rectoproc({n*(n-3)*a(n)-(2*n-1)*(n-3)*a(n-1)+(-n^2+4*n-5)*a(n-2)-(n-1)*(2*n-7)*a(n-3)+(n-1)*(n-4)*a(n-4) = 0, a(0) = 2, a(1) = 1, a(2) = 1, a(3) = 4},a(n),remember):
map(f, [$0..40]); # Robert Israel, Dec 06 2017
a := n -> `if`(n=0,2,2*add(((1+(-1)^(n-k)))*n*k*binomial((n+k)/2, k)^2*1/((n+k))^2, k=0..n)): seq(a(n), n=0..32); # Leonid Bedratyuk, Dec 07 2017

CoefficientList[Series[(1-x^2+Sqrt[1-2*x-x^2-2*x^3+x^4])/Sqrt[1-2*x-x^2-2*x^3+x^4], {x, 0, 20}], x] (* Vaclav Kotesovec, Jan 05 2013 *)

x='x+O('x^66); Vec( (1-x^2+sqrt(1-2*x-x^2-2*x^3+x^4))/sqrt(1-2*x-x^2-2*x^3+x^4) ) \\ Joerg Arndt, May 04 2013

G.f.: (1 - t^2 + sqrt(1 - 2*t - t^2 - 2*t^3 + t^4))/sqrt(1 - 2*t - t^2 - 2*t^3 + t^4).
a(n) = sum{k=0..floor(n/2), (n/(n-k))C(n-k, k)*(-1)^k*sum{i=0..floor((n-2k)/2), C(n-2k, 2i)C(2i, i)}}; a(n)=sum{k=0..floor(n/2), (n/(n-k))C(n-k, k)*(-1)^k*A002426(n-2k)}. - Paul Barry, Jan 31 2005
Conjecture: n*(n-3)*a(n) - (2*n-1)*(n-3)*a(n-1) + (-n^2+4*n-5)*a(n-2) - (n-1)*(2*n-7)*a(n-3) + (n-1)*(n-4)*a(n-4) = 0. - R. J. Mathar, Nov 30 2012
Conjecture confirmed using the differential equation (2*x^2-x+2)*y(x) + (4*x^4-5*x^3-x^2+x-2)*y'(x) + (x^5-2*x^4-x^3-2*x^2+x)*y''(x) - 2*x^2 + x - 2 = 0 satisfied by the g.f. - Robert Israel, Dec 06 2017
a(n) ~ 5^(1/4)*((1+sqrt(5))/2)^(2*n)/(2*sqrt(Pi*n)). - Vaclav Kotesovec, Jan 05 2013
a(n) = 2n Sum_{k=0..n}(1+(-1)^(n-k))*C((n+k)/2,k)^2*k/((n+k))^2 for n > 0. - Leonid Bedratyuk, Dec 06 2017

A246840 Expansion of Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * x^(2*k).

Original entry on oeis.org

1, 1, 1, 2, 5, 10, 18, 35, 73, 151, 306, 623, 1286, 2668, 5531, 11477, 23889, 49852, 104175, 217936, 456534, 957609, 2010839, 4226417, 8891022, 18719637, 39443860, 83170162, 175484915, 370491775, 782648333, 1654197568, 3498049053, 7400639286, 15664103420, 33168342557, 70260909811

Offset: 0

Paul D. Hanna, Sep 04 2014

nonn

Compare to the g.f. of Narayana's cows sequence A000930:
Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k) * x^(2*k)  =  1/(1-x-x^3).
Compare to the g.f. of Whitney numbers sequence A051286:
Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * x^k = 1/sqrt((1+x+x^2)*(1-3*x+x^2)).
...
Lim_{n->infinity} a(n)/a(n+1) = t^2 = 0.465571231876768... (A088559) where t = ((sqrt(93)+9)/18)^(1/3) - ((sqrt(93)-9)/18)^(1/3) is the positive real root of 1 - x - x^3 = 0.
Diagonal of the rational function 1 / ((1 - x)*(1 - y) - (x*y)^3). - Ilya Gutkovskiy, Apr 23 2025

			G.f.: A(x) = 1 + x + x^2 + 2*x^3 + 5*x^4 + 10*x^5 + 18*x^6 + 35*x^7 + ...
where, by definition,
A(x) = 1 + x*(1 + x^2) + x^2*(1 + 2^2*x^2 + x^4)
+ x^3*(1 + 3^2*x^2 + 3^2*x^4 + x^6)
+ x^4*(1 + 4^2*x^2 + 6^2*x^4 + 4^2*x^6 + x^8)
+ x^5*(1 + 5^2*x^2 + 10^2*x^4 + 10^2*x^6 + 5^2*x^8 + x^10) + ...
which is also given by the series identity:
A(x) = 1/(1-x+x^3) + 2*x^3/(1-x+x^3)^3 + 6*x^6/(1-x+x^3)^5 + 20*x^9/(1-x+x^3)^7 + 70*x^12/(1-x+x^3)^9 + 252*x^15/(1-x+x^3)^11 + 924*x^18/(1-x+x^3)^13 + ...
The logarithm of the g.f. begins:
log(A(x)) = x*(1 + x^2) + x^2*(1 + 6*x^2 + x^4)/2
+ x^3*(1 + 15*x^2 + 15*x^4 + x^6)/3
+ x^4*(1 + 28*x^2 + 70*x^4 + 28*x^6 + x^8)/4
+ x^5*(1 + 45*x^2 + 210*x^4 + 210*x^6 + 45*x^8 + x^10)/5 + ...
more explicitly,
log(A(x)) = x + x^2/2 + 4*x^3/3 + 13*x^4/4 + 26*x^5/5 + 46*x^6/6 + 99*x^7/7 + 229*x^8/8 + 499*x^9/9 + 1046*x^10/10 + 2223*x^11/11 + 4810*x^12/12 + ...
where the logarithmic derivative equals
A'(x)/A(x) = (1-x+3*x^2+4*x^3-3*x^5)/((1-x+2*x^2-x^3)*(1-x-2*x^2-x^3)).

G. C. Greubel, Table of n, a(n) for n = 0..1000
Hacène Belbachir and Abdelghani Mehdaoui, Recurrence relation associated with the sums of square binomial coefficients, Quaestiones Mathematicae (2021) Vol. 44, Issue 5, 615-624.

Cf. A088559, A246861, A181665, A246883, A246884, A248193.

CoefficientList[Series[1/Sqrt[(1 - x - x^3)^2 - 4*x^4], {x,0,50}], x] (* G. C. Greubel, Apr 27 2017 *)

/* By definition: */
{a(n)=local(A=1);A=sum(m=0,n,x^m*sum(k=0,m,binomial(m,k)^2*x^(2*k)) +x*O(x^n));polcoeff(A,n)}
for(n=0,40,print1(a(n),", "))

/* From closed formula: */
{a(n)=local(A=1);A= 1/sqrt((1 - x - x^3)^2 - 4*x^4 +x*O(x^n));polcoeff(A, n)}
for(n=0,40,print1(a(n),", "))

/* From a series identity: */
{a(n)=local(A=1+x); A=sum(m=0, n, (2*m)!/(m!)^2 * x^(3*m) / (1 - x + x^3 +x*O(x^n))^(2*m+1)); polcoeff(A, n)}
for(n=0, 40, print1(a(n), ", "))

/* From a binomial series identity: */
{a(n)=local(A=1+x); A=sum(m=0, n, x^m*(1-x^2)^(2*m+1)*sum(k=0, n, binomial(m+k, k)^2*x^(2*k)) +x*O(x^n)); polcoeff(A, n)}
for(n=0, 40, print1(a(n), ", "))

/* From a binomial series identity: */
{a(n)=local(A=1+x); A=sum(m=0, n\3, x^(3*m)*sum(k=0, n-3*m, binomial(m+k, k)^2*x^k) +x*O(x^n)); polcoeff(A, n)}
for(n=0, 40, print1(a(n), ", "))

/* From a binomial series identity: */
{a(n)=local(A=1+x); A=sum(m=0, n\3, x^(3*m) * sum(k=0, m, binomial(m, k)^2*x^k) / (1-x +x*O(x^n))^(2*m+1) ); polcoeff(A, n)}
for(n=0, 40, print1(a(n), ", "))

/* From exponential formula: */
{a(n)=local(A=1);A=exp(sum(m=1, n, sum(k=0, m, binomial(2*m, 2*k)*x^(2*k)) * x^m/m) +x*O(x^n));polcoeff(A, n)}
for(n=0,40,print1(a(n),", "))

/* From exponential formula: */
{a(n)=local(A=1);A=exp(sum(m=1, n, ((1+x)^(2*m) + (1-x)^(2*m))/2 * x^m/m) +x*O(x^n));polcoeff(A, n)}
for(n=0,40,print1(a(n),", "))

/* From formula for a(n): */
{a(n)=sum(k=0,n\2,binomial(n-2*k,k)^2)}
for(n=0,40,print1(a(n),", "))

G.f.: Sum_{n>=0} (2*n)!/(n!)^2 * x^(3*n) / (1 - x + x^3)^(2*n+1). - Paul D. Hanna, Oct 15 2014
G.f.: Sum_{n>=0} x^n * [Sum_{k>=0} C(n+k,k)^2 * x^(2*k)] * (1-x^2)^(2*n+1).
G.f.: Sum_{n>=0} x^(3*n) * [Sum_{k>=0} C(n+k,k)^2 * x^k].
G.f.: Sum_{n>=0} x^(3*n) * [Sum_{k=0..n} C(n,k)^2 * x^k] /(1-x)^(2n+1).
G.f.: exp( Sum_{n>=1} (x^n/n) * Sum_{k=0..n} C(2*n,2*k) * x^(2*k) ).
G.f.: exp( Sum_{n>=1} (x^n/n) * ((1+x)^(2*n) + (1-x)^(2*n))/2 ).
G.f.: 1 / sqrt((1 - x + 2*x^2 - x^3)*(1 - x - 2*x^2 - x^3)).
G.f.: 1 / sqrt((1 - x - x^3)^2 - 4*x^4).
a(n) = Sum_{k=0..floor(n/2)} C(n-2*k, k)^2.
n*a(n) = (2*n-1)*a(n-1) - (n-1)*a(n-2) + (2*n-3)*a(n-3) + 2*(n-2)*a(n-4) - (n-3)*a(n-6). - Seiichi Manyama, Aug 10 2024

cp's OEIS Frontend

A192685 Floor-Sqrt transform of numbers of A051286.

Views

Author

Keywords

Programs

Mathematica

Formula

A049310 Triangle of coefficients of Chebyshev's S(n,x) := U(n,x/2) polynomials (exponents in increasing order).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

A109466 Riordan array (1, x(1-x)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A168561 Riordan array (1/(1-x^2), x/(1-x^2)). Unsigned version of A049310.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A108479 Antidiagonal sums of number triangle A086645.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A110320 Number of blocks in all RNA secondary structures with n nodes (an RNA secondary structure can be viewed as a restricted noncrossing partition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A181545 G.f.: A(x) = Sum_{n>=0} (3n)!/(n!)^3 * x^(3n)/(1-x-x^2)^(3n+1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs