-89

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=52A000036
• a(n) = -a(n-1) - 2*a(n-2).at n=15A001607
• Zeroth row of infinite Latin square heading to -oo.at n=37A019585
• Expansion of tanh(tan(x)*sin(x))/2.at n=3A024239
• Expansion of (eta(q) * eta(q^2) * eta(q^3) * eta(q^6))^2 in powers of q.at n=24A030209
• Column 1 of Inverse partition triangle A038498.at n=56A039800
• Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.at n=40A045893
• a(n) = a(n-1) - a(n-3) with a(1)=0, a(2)=0, a(3)=1.at n=34A050935
• Consider real quadratic fields of ERD-type with class groups of exponent 2 and discriminants of the form D = r^2*k^2+4k, k odd; sequence gives values of k.at n=51A051998
• Smallest (in magnitude) nonzero number m such that n!+m is prime.at n=22A053714
• Smallest (in magnitude) nonzero number m such that n!+m is prime.at n=45A053714
• a(n) = -2*a(n - 1) -a(n - 2) -a(n - 3), a(0) = a(1) = a(2) = 1.at n=9A056016
• Numbers k such that 36*k^2 + 12*k + 5 is prime (sorted by absolute values with negatives before positives).at n=49A056907
• Signed distance of primes from LCM(1,...,x) being closest to it. Arguments x were selected from A000961 (powers of primes including primes) in order to use distinct values of LCM exactly once. When both closest primes are in the same distance, then negative were used.at n=32A058030
• McKay-Thompson series of class 30a for Monster.at n=11A058619
• McKay-Thompson series of class 30e for Monster.at n=72A058626
• McKay-Thompson series of class 46A for the Monster group.at n=47A058688
• Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)...(1-x^N)) for N = 4.at n=24A060023
• Generalized sum of divisors function: second diagonal of A060184.at n=58A060185
• Numerator of Sum_{k=1..n} mu(k)/k.at n=13A070888