63248

Appears in sequences

• Numbers m such that 2*m - sigma(m) is a divisor of m and greater than one, where sigma = A000203 is the sum of divisors.at n=19A060326
• Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).at n=31A067282
• Numbers k whose abundance sigma(k) - 2*k = -16. Numbers k whose deficiency is 16.at n=11A125248
• Monotonic ordering of set S generated by these rules: if x and y are in S and x^2-y^2>0 then x^2-y^2 is in S, and 2 and 3 are in S.at n=37A192648
• Number of nX2 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X3 0..3 array.at n=3A229101
• Number of n X 4 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 5 0..3 array.at n=1A229103
• T(n,k) = number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array.at n=11A229105
• T(n,k) = number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array.at n=13A229105
• Deficient-perfect numbers: Deficient numbers n such that n/(2n-sigma(n)) is an integer.at n=35A271816
• Numbers k such that sigma(k) == 0 (mod k-8).at n=21A274562
• Numbers n for which A294898(n) is not zero and A294898(n) divides A000120(n); numbers for which A326130(n) = abs(A294898(n)).at n=24A326132
• Expansion of 1 / (1 + Sum_{k>=1} mu(k)^2 * x^k).at n=54A329099
• Deficient numbers k > 1 such that k*p is abundant for all primes p dividing k.at n=8A341358