31049
domain: N
Appears in sequences
- Tribonacci-like sequence; a(0)=2, a(1)=1, a(2)=1, a(n) = a(n-1) + a(n-2) + a(n-3).at n=18A141036
- Numbers n such that sigma(n+1) - sigma(n-1) = n+1.at n=4A260420
- Let f(x) = 1 + Sum_{j>=4} (|mu(j)| - |mu(j-1)|)*x^j, where mu(n) is the Möbius function (A008683). Then a(n) is n times the coefficient of x^n in the expansion of log(f(x)).at n=45A262400
- Deficiency of prime-shifted squares: a(n) = 2*A003961(n^2) - sigma(A003961(n^2)), where A003961 is fully multiplicative function with a(prime(i)) = prime(i+1).at n=55A378231