-57

Appears in sequences

• Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).at n=37A000036
• The negative integers.at n=56A001478
• a(n) = -n.at n=57A001489
• G.f.: Product_{k>0} (1-x^(5k-1))*(1-x^(5k-4))/((1-x^(5k-2))*(1-x^(5k-3))).at n=59A007325
• Expansion of e.g.f. cos(sinh(x)*cos(x)), even terms only.at n=3A009060
• tanh(sin(arctanh(x)))=x-1/3!*x^3+1/5!*x^5-57/7!*x^7-3167/9!*x^9...at n=3A012058
• tanh(tan(arcsinh(x)))=x-1/3!*x^3+1/5!*x^5-57/7!*x^7+4513/9!*x^9...at n=3A012165
• Expansion of e.g.f.: arctan(cosh(x)*log(x+1))=x-1/2!*x^2+3/3!*x^3-57/5!*x^5+405/6!*x^6...at n=5A012759
• Zeroth row of infinite Latin square heading to -oo.at n=38A019585
• Expansion of sin(sin(x)*x)/2.at n=3A024237
• a(n) = n*(-1)^n.at n=57A038608
• Solutions s to the equation 1=s*prime(n)+t*prime(n+1) with |s| as small as possible.at n=47A045892
• Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.at n=49A045893
• Generalized Stirling number triangle of first kind.at n=26A051339
• Second differences of sigma(n).at n=48A053223
• Coefficients of the '5th-order' mock theta function f_1(q).at n=75A053257
• a(n) = Sum_{d|2n+1} phi(d)*mu(d).at n=29A054586
• Matrix inverse of Euler's triangle A008292.at n=19A055325
• n - reversal of base 20 digits of n (written in base 10).at n=45A055967
• n - reversal of base 20 digits of n (written in base 10).at n=24A055967