-71

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=45A000036
• Bessel polynomial y_n(-2).at n=3A002119
• Reversion of g.f. for Euler numbers A000111(n-1).at n=7A007316
• Expansion of e.g.f: (1+x)*cos(x).at n=71A009001
• Shifts 2 places right under binomial transform.at n=6A010738
• Shifts 2 places left under inverse binomial transform.at n=8A010739
• sin(sinh(x)+tan(x))=2*x-5/3!*x^3-71/5!*x^5-863/7!*x^7-11207/9!*x^9...at n=2A013045
• Expansion of e.g.f.: exp(tanh(x)+sin(x))=1+2*x+4/2!*x^2+5/3!*x^3-8/4!*x^4-71/5!*x^5...at n=5A013129
• Zeroth row of infinite Latin square heading to -oo.at n=46A019585
• Discriminants of quadratic number fields Q(sqrt -n) for n squarefree.at n=44A033197
• Matrix 7th power of inverse partition triangle A038498.at n=28A050310
• a(n) = a(n-1) - a(n-3) with a(1)=0, a(2)=0, a(3)=1.at n=45A050935
• Coefficients of the '6th-order' mock theta function psi(q).at n=32A053269
• Smallest (in magnitude) nonzero number m such that n!+m is prime.at n=61A053714
• Smallest (in magnitude) nonzero number m such that n!+m is prime.at n=60A053714
• a(n) = Sum_{d|2n+1} phi(d)*mu(d).at n=36A054586
• Matrix inverse of triangle A055363(n+2,k).at n=41A055370
• a(n) = n * mu(n), where mu is the Möbius function A008683.at n=70A055615
• The x value of the unique nontrivial solution to x^3 + d*y^3 = 1 for all admissible (d = 2,7,9,17,..., A005988).at n=36A055735
• Numbers n where 36n^2+24n+7 is prime (sorted by absolute values with negatives before positives).at n=50A056902