-129

Appears in sequences

• E.g.f. log(1 + log(1+x)*exp(x)).at n=6A009321
• Expansion of e.g.f. sinh(log(1+x))*exp(x).at n=6A009574
• McKay-Thompson series of class 24f for Monster.at n=19A058589
• a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].at n=39A059878
• a(n) = n*p(n+1)-(n+1)*p(n) = n*d(n)-p(n), where p(n) is the n-th prime and d(n) is the n-th prime-difference, A001223(n).at n=48A062357
• Little Hankel transform of A002487.at n=66A070949
• Let F(x) be the function such that F(F(x)) = arctan(x), then F(x) = Sum_{n>=0} a(n)*x^(2n+1)/(2n+1)!.at n=3A095885
• Matrix inverse of triangle A091491, read by rows.at n=87A104402
• Row sums of triangle A104505, which is equal to the right-hand side of the triangle A084610 of coefficients in (1+x-x^2)^n.at n=9A104507
• a(2*n) = -(2^(2*n+1) + 1), a(2*n+1) = (2^(n+1) - (-1)^n)^2.at n=6A105951
• Expansion of sqrt(1-4x)/(1-x).at n=6A106191
• Binomial transform of denominators in a zeta function.at n=7A106398
• Triangle, read by rows: T(0,0) = 1, T(n,k) = F(n+1)*T(n-1,k) - T(n-1,k-1) where F(n+1) is the (n+1)st Fibonacci number.at n=18A107416
• Inverse of number-theoretic triangle A109974.at n=43A109977
• G.f.: A(x) = Product_{k>=1} (1 + x^k)^(-lambda(k)) where lambda(k) is the Liouville function, A008836.at n=71A118208
• Matrix inverse of triangle A121335, where A121335(n,k) = C( n*(n+1)/2 + n-k + 1, n-k) for n>=k>=0.at n=10A121440
• Expansion of (1+x^2+x^4)/(1-x^6+x^7).at n=55A124751
• Triangular sequence from polynomials that gives roots near 137.at n=36A134885
• Triangle read by rows of coefficients of Chebyshev-like polynomials P_{n,4}(x) with 0 omitted (exponents in increasing order).at n=22A136390
• Expansion of (1-2x-5x^2-7x^3+x^6)/((1-x)(1-x^3)^2).at n=13A141352