47804

Appears in sequences

• Numbers n such that n | sigma_12(n).at n=37A055716
• Reversion of y - y^2 + y^3 - y^4.at n=15A063019
• Coefficients of the Pascal sequence minus the Eulerian numbers: q(x,n)= = (1 - x)^(n + 1)*PolyLog[ -n, x]; p(x,n) = (q(x, n)/x - (x + 1)^(n - 1))/x.at n=29A146749
• Coefficients of the Pascal sequence minus the Eulerian numbers: q(x,n)= = (1 - x)^(n + 1)*PolyLog[ -n, x]; p(x,n) = (q(x, n)/x - (x + 1)^(n - 1))/x.at n=34A146749
• Coefficients of the Pascal sequence minus the Eulerian numbers with first and last columns subtracted: f(n)=2^n - 2n; q(x,n)= = (1 - x)^(n + 1)*PolyLog[ -n, x]; p(x,n) = ((q(x, n)/x - (x + 1)^(n - 1))/x - f[n] - f[n]*x^(n - 3))/x.at n=15A146750
• Coefficients of the Pascal sequence minus the Eulerian numbers with first and last columns subtracted: f(n)=2^n - 2n; q(x,n)= = (1 - x)^(n + 1)*PolyLog[ -n, x]; p(x,n) = ((q(x, n)/x - (x + 1)^(n - 1))/x - f[n] - f[n]*x^(n - 3))/x.at n=20A146750
• a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=37A156778
• Numbers n such that Sum_{i = 1..q} 1/d(i) is an integer where d(i) are the divisors of n for some q and n is primitive (the set {d(1), d(2), ..., d(q)} appears only once).at n=19A226853
• Primitive abundant numbers version 2 (abundant numbers all of whose proper divisors are deficient numbers) and increasing any prime factor in the prime factorization gives a non-abundant number when factored back.at n=36A335557
• Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments.at n=21A352739