8382464

Appears in sequences

• Numbers k such that sigma(k) == 2 (mod k).at n=8A045768
• Numbers n such that sigma(n) = 2n + omega(n), where omega(n) is the number of distinct prime divisors of n.at n=9A063785
• The floor(n/2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.at n=13A066240
• Numbers k whose abundance-radius does not exceed log(log(k)), i.e., abs(sigma(k)-2*k) <= log(log(k)).at n=27A088818
• Numbers k whose abundance is 2: sigma(k) - 2k = 2.at n=7A088831
• Expansion of (4 - 7*x + 2*x^2)/((1-2*x)*(1 - 2*x + 2*x^2)).at n=22A100215
• Admirable numbers whose abundance is < 10.at n=33A109788
• Fibonacci 13-step numbers.at n=36A168084
• Near-perfect numbers (A181595) of the form 2^(t-1)*(2^t-2^k-1), where 2^t-2^k-1 is prime, k>=1, t>k.at n=28A181701
• Numbers of the form 2^(t-1)*(2^t-3), where 2^t-3 is prime.at n=6A181703
• Numbers m such that floor(antisigma(m) / m) = antisigma(m) mod m.at n=17A244324
• Admirable numbers such that the subtracted divisor is a Fibonacci number.at n=34A282754
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=22A287859
• Numbers k such that bsigma(k) = 2k + 2, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=7A322162
• a(n) is the largest positive integer that is abundant and has the same prime signature as A025610(n) or 0 if no such number exists.at n=39A343329
• Practical numbers (A005153) that are abundant and have a record low value of abundancy index.at n=22A362052
• Primitive abundant numbers k (A071395) whose abundancy index sigma(k)/k has a record low value.at n=23A362053
• Composite integers k such that sigma(k) | (k + 1)*tau(k) where tau is number of divisors of k.at n=26A384493