-425
domain: Z
Appears in sequences
- Start with 1, add the next number if one gets a prime then add the next number else subtract the next...at n=32A074170
- Inverse binomial transform of A140359.at n=9A140360
- First differences of A066841.at n=5A140554
- FP2 polynomials related to the generating functions of the left hand columns of the A156920 triangle.at n=16A156925
- G.f. of the z^2 coefficients of the FP2 in the third column of the A156925 matrix.at n=2A156935
- Coefficient array of orthogonal polynomials P(n,x)=(x-n)*P(n-1,x)-(2n-3)*P(n-2,x), P(0,x)=1,P(1,x)=x-1.at n=24A178124
- Alternating sum of cubes, i.e., Sum_{k=0..n} k^p*q^k for p=3, q=-1.at n=9A232599
- Hankel transform of A191529.at n=36A283436
- Hankel transform of A191529.at n=37A283436
- G.f.: Im((i*x; x)_inf), where (a; q)_inf is the q-Pochhammer symbol, i = sqrt(-1).at n=52A292043
- Expansion of Product_{k>=1} ((1 - x^(2*k))/(1 - x^(2*k-1)))^k.at n=47A296046
- G.f. A(x) satisfies: 1/(1 + x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=25A307657
- 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 u+v.at n=53A345425