-5120

Appears in sequences

• Triangle of coefficients of Chebyshev polynomials U_n(x).at n=40A008312
• Sum of (Gaussian) q-binomial coefficients for q=-3.at n=6A015154
• a(n+1)=2a(n)-4a(n-1)+4a(n-2).at n=16A035302
• Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...).at n=17A051165
• Triangle read by rows of coefficients of Chebyshev's U(n,x) polynomials (exponents in increasing order).at n=75A053117
• Triangle of coefficients of Chebyshev's U(n,x) polynomials (exponents in decreasing order).at n=68A053118
• Triangle T(n,k) of coefficients relating to Bezier curve continuity.at n=56A065109
• Expansion of q^(-1/24) (m (1-m) / 16)^(1/24) in powers of q, where m = k^2 is the parameter and q is the nome for Jacobian elliptic functions.at n=53A081360
• Triangle read by rows: nonzero coefficients of polynomials 2^n*E(n,x), with E the Euler polynomials.at n=36A099932
• Column 0 of triangle A118441, which is the matrix log of triangle A118435.at n=10A118442
• a(n) = prime(n)*(prime(n + 1) + 1) - (n^3 + sum of digits of n^3).at n=23A123139
• Irregular triangle read by rows: coefficients of U(n,x), Chebyshev polynomials of the second kind with exponents in decreasing order.at n=37A133156
• a(n) = 2*a(n-1) - 2*a(n-2), with a(0)=1, a(1)=5.at n=21A136258
• Integral form of A053120 :Triangle of coefficients of Integral form Chebyshev's T(n, x) polynomials (powers of x in increasing order); Much improved version by use of the integro-differential recursive form over a previous attempt.at n=64A136265
• A triangle of coefficients based on A139360 as an n-like set of three binomials: f(x,y,n)=ChebyshevT[n, x]*ChebyshevT[n, y] + ChebyshevT[n, x] + ChebyshevT[n, y]; p(x,y,z,n)=f(x,y,n)+f(y,z,n)+f(z,x,n).at n=63A139604
• Triangle T(n, k) = 0 if BernoulliB(n-k) = 0 otherwise round( binomial(n, k)/BernoulliB(n-k)^k ), read by rows.at n=64A156811
• A triangle of coefficients Pseudo-Hadamard matrices as integer characteristic polynomials (the code and initial values are very long, but the basic recurrence is the Hadamard matrix self-similarity).at n=59A158239
• Inverse binomial transform of A166517.at n=12A166577
• a(n) = 2^n*floor((5-2*n)/3).at n=10A171552
• a(n) = sin((2*n+5)*Pi/6)*(n+1)*2^(n+1).at n=9A176900