88723

Appears in sequences

• Numbers k that divide 9^k + 8^k.at n=8A045607
• Primitive numbers k that divide sigma(k)*phi(k).at n=17A055196
• Numbers k such that Euler phi(k) / Carmichael lambda(k) = 34.at n=16A066698
• a(n) = n^4 + n^3 + n^2.at n=17A100019
• a(0)=0, a(1)=1, a(2n)=17*a(n), a(2n+1)=a(2n)+1.at n=28A197351
• Numbers such that the sequence of all possible sums of divisors of n is increasing but not strictly so, the sums being ordered by their characteristic functions, seen as binary numbers (see example).at n=32A230492
• Integers m such that A240923(m) = 1, where A240923(n) = numerator(sigma(n)/n) - sigma(denominator(sigma(n)/n)).at n=15A240991
• Odd composite numbers n, not squares of primes, such that (A001065(n) - A032742(n)) divides (n - A032742(n)), where A032742 gives the largest proper divisor, and A001065 is the sum of proper divisors.at n=4A326064
• Odd numbers k that have a divisor d such that sigma(d)*d is equal to k.at n=7A327599
• Square array A(n, k) = A064987(A246278(n, k)), read by falling antidiagonals; A064987(n) = n*sigma(n), applied to the prime shift array.at n=34A379499
• Square array A(n, k) = A249670(A246278(n, k)), read by falling antidiagonals; A249670(n) = A017665(n)*A017666(n), applied to the prime shift array.at n=34A379500
• Numbers k such that sigma(A253560(k)) / A253560(k) is equal to (sigma(k)+1) / k, where A253560(k) = k multiplied by its largest prime factor.at n=22A387406