-58

Appears in sequences

• The negative integers.at n=57A001478
• a(n) = -n.at n=58A001489
• a(n) = Sum_{t=0..n} g(t)*g(n-t) where g(t) = A002121(t).at n=16A002122
• Glaisher's chi numbers chi(p) for p a prime of the form 4m+1.at n=72A002172
• Expansion of e.g.f. cos(log(1+x)/exp(x)).at n=4A009034
• E.g.f. log(1 + x*exp(-x)).at n=4A009444
• sin(tan(x)*sin(x))=2/2!*x^2+4/4!*x^4-58/6!*x^6-1976/8!*x^8...at n=3A009513
• Duplicate of A009513.at n=2A012366
• arcsinh(tan(x)*sin(x))=2/2!*x^2+4/4!*x^4-58/6!*x^6-1976/8!*x^8...at n=2A012370
• Dirichlet inverse of Euler totient function (A000010).at n=58A023900
• a(n) = Sum_{k=1..n} (-1)^k*k*floor(n/k).at n=44A024919
• Expansion of square root of q times normalized Hauptmodul for Gamma(4) in powers of q^8.at n=67A029838
• Abundance of n, or (sum of divisors of n) - 2n.at n=58A033880
• 7th differences of primes.at n=52A036268
• a(n) = Sum_{ d divides n, d==1 mod 4} d - Sum_{ d divides n, d==3 mod 4} d.at n=58A050457
• a(n) = n^2 - primefloor(n)*primeceiling(n).at n=31A056139
• a(n) = n^2 - previousprime(n)*nextprime(n), for n>2.at n=30A056140
• Numbers k such that 36*k^2 + 12*k + 5 is prime (sorted by absolute values with negatives before positives).at n=37A056907
• a(n+3)=a(n)+a(n+1)-a(n+2), starting with 1,2,3.at n=61A057174
• McKay-Thompson series of class 15B for Monster.at n=17A058509