-358

Appears in sequences

• Expansion of Product_{m >= 1} (1 + q^m)^(-2).at n=29A022597
• Euler transform of negative integers.at n=29A073592
• a(n) = floor( prime(n-1)*A036263(n-2)/ A001223(n-1)).at n=39A094900
• G.f.: 1-q = Sum_{k>=0} a(k)*q^k*Faq(k+1,q), where Faq(n,q) is the q-factorial of n.at n=11A127926
• Result of using the primes as coefficients in an infinite polynomial series in x and then expressing this series as (1+x)(1+a(1)*x)(1+a(2)*x^2) ... .at n=21A147541
• Expansion of a(q) * f(-q)^4 where f() is a Ramanujan theta function and a() is a cubic AGM function.at n=51A152243
• Triangular array T read by rows: T(n, k) = Sum_{i=0..2*n-2*k} binomial(2*n-2*k, i)*binomial(2*k, i)*(-1)^i, 0 <= k <= n.at n=70A184879
• G.f.: Product_{k>=1} 1/(1+x^k)^k.at n=27A255528
• Expansion of phi(-x^3) / f(-x^2) in powers of x where phi(), f() are Ramanujan theta functions.at n=33A256636
• Expansion of Product_{k>=1} (1 - Sum_{j>=1} j * x^(k*j)).at n=18A329157
• Expansion of Product_{k>=1} (1 - Sum_{j>=1} j * x^(k*j)).at n=24A329157
• a(n) = (-1)^(n + 1) * n * ceiling(n/2) + Sum_{k=1..n} (-1)^k * k^2 * floor(n/k).at n=50A329970
• For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of v.at n=60A345424
• Dirichlet inverse of A341530, gcd(n*sigma(A003961(n)), sigma(n)*A003961(n)).at n=43A346235
• a(n) = Sum_{k=1..n} (-1)^(n-k) * k * mu(k)^2, where mu(k) is the Moebius function.at n=57A362029
• a(n) = 2*n - phi(A003961(n)), where phi is Euler totient function and A003961 is fully multiplicative function with a(prime(i)) = prime(i+1).at n=63A377985