-501
domain: Z
Appears in sequences
- Expansion of (1-x)/(1+x+x^2-2*x^3).at n=15A078045
- Alternating sum of diagonals in A060177.at n=41A104575
- Triangle, read by rows, given by the product Q^-2*P^3 using triangular matrices P=A113370, Q=A113381.at n=15A114155
- Triangle, read by rows, equal to the matrix inverse of P=A113370.at n=15A114156
- Column 0 of triangle A114156, which is the matrix inverse of A113370.at n=5A114157
- Number triangle T(n,k)=sum{i=0..n, (-1)^(n-i)*C(n,i)*sum{j=0..i-k, C(k,2j)*C(i-k,2j)}}.at n=60A119328
- Triangle read by rows of coefficients of Chebyshev-like polynomials P_{n,5}(x) with 0 omitted (exponents in increasing order).at n=43A136397
- Triangle read by rows: row n (n>=0) gives the coefficients of the polynomial p(n,x) of degree n defined in comments.at n=29A159041
- Triangle read by rows: row n (n>=0) gives the coefficients of the polynomial p(n,x) of degree n defined in comments.at n=34A159041
- Triangle read by rows: T(n,0) = n+1, T(n,k) = 2*T(n-1,k) - T(n-1,k-1), T(n,k) = 0 if k > n and if k < 0.at n=31A159856
- Riordan array T((1-x)^(-2) | 2x-1) read by rows.at n=23A181690
- Values of n such that L(1) and N(1) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=38A226921
- First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood.at n=15A270637
- Expansion of Product_{k>0} ((1-x^{5k-2}) * (1-x^{5k-3})/((1-x^{5k-1}) * (1-x^{5k-4})))^4 in powers of x.at n=20A285444
- Expansion of e.g.f.: exp(-x/(1+x)).at n=5A293125
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(-x^(k+1)/(1+x)).at n=20A293134
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Product_{j=1..n} 1/(1+x^j) - 1).at n=26A294289
- Expansion of Product_{k>=1} (1 - x^k)^(k+1).at n=32A299019
- Expansion of Product_{k>=1} 1/(1 + q(k)*x^k), where q(k) = number of partitions of k into distinct parts (A000009).at n=21A316231
- a(n) = A294898(A122111(n)).at n=56A323167