-1191

Appears in sequences

• a(n) = -a(n-2) + 2*a(n-4) - a(n-10).at n=22A089135
• Expansion of x*(x^3+2*x^2+3*x-1)/(x+1)^5.at n=9A119515
• Triangle read by rows: imaginary part of polylog expansion of Eulerian numbers: p(x,n) = (1 - I*x)^(n + 1)*PolyLog(-n, I*x)/x.at n=24A143197
• A triangular recursion sequence: A(n,k,m)= (m* n - m*k + 1)*A(n - 1, k - 1, m) + (m*k - (m - 1))*A(n - 1, k, m); t(n,k)=2*A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1).at n=23A156534
• A triangular recursion sequence: A(n,k,m)= (m* n - m*k + 1)*A(n - 1, k - 1, m) + (m*k - (m - 1))*A(n - 1, k, m); t(n,k)=2*A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1).at n=25A156534
• Triangle formed by coefficients of the expansion of p(x, n), where p(x,n) = (1+x-x^3)^(n+1)*Sum_{j >= 0} (j+1)^n*(-x + x^3)^j.at n=56A156896
• Values of n such that L(13) and N(13) 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=15A227516
• G.f. A(x) satisfies: [x^n] A(x)^(n^2-n+1) = 0 for n>=2.at n=6A229041
• a(1) = 1; a(n) = -Sum_{k=2..n} k^2 * a(floor(n/k)).at n=32A360390