-103

Appears in sequences

• a(n) = 5^n - n^7.at n=2A024056
• a(n) = H_n(1) / 2^floor(n/2) where H_n is the n-th Hermite polynomial.at n=8A025165
• Coefficients of the '6th-order' mock theta function psi(q).at n=36A053269
• Smallest (in magnitude) nonzero number m such that n!+m is prime.at n=68A053714
• a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=0, a(1)=0, a(2)=1.at n=18A057597
• 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=30A058030
• Second term in the continued fraction expansion of StieltjesGamma[n].at n=2A066034
• a(n) = prime(n)-n*tau(n) where tau(n) is the number of divisors of n.at n=23A067292
• Alternating sum sigma(1)-sigma(2)+sigma(3)-sigma(4)+...+((-1)^(n+1))*sigma(n).at n=21A068762
• Signed primes: if prime(n) even, a(n) = 0; if prime(n) == 1 (mod 4), a(n) = prime(n); if prime(n) == -1 (mod 4), a(n) = -prime(n).at n=26A073579
• a(1) = 1, a(2n) = a(2n-1) + c(n) and a(2n+1) = a(2n) - p(n), where c(n)=A002808(n) and p(n)=A000040(n) are the n-th composite and n-th prime numbers, respectively.at n=30A073891
• a(1) = 1, a(2n) = a(2n-1) + c(n) and a(2n+1) = a(2n) - p(n), where c(n)=A002808(n) and p(n)=A000040(n) are the n-th composite and n-th prime numbers, respectively.at n=33A073891
• Expansion of (1-x)/(1-x+x^2+x^3).at n=16A078016
• Expansion of (1-x)/(1 + x + x^2 - x^3).at n=16A078046
• Array of coefficients of characteristic polynomials of M_n, the n X n matrix with entries m_(i,j) = i mod j.at n=38A078924
• Partial sums of Mertens's function (A002321).at n=53A091555
• a(n+3) = a(n) - a(n+1) - a(n+2); a(0) = -5, a(1) = 6, a(2) = 0.at n=11A105580
• Sequence is {a(5,n)}, where a(m,n) is defined at sequence A110665.at n=7A110670
• Row sums of number triangle A112334.at n=35A112335
• Sum(mu(i)*phi(j): i+j=n), with mu=A008683 and phi=A000010.at n=41A112962