236925

Appears in sequences

• Odd numbers divisible by exactly 9 primes (counted with multiplicity).at n=25A046322
• Numbers that have exactly nine prime factors counted with multiplicity (A046312) whose digit reversal is different and also has 9 prime factors (with multiplicity).at n=18A109029
• Odd numbers of the form p^(1+4k) * r^2, where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1 that are closer to being perfect than previous terms.at n=4A228059
• Odd numbers k such that A318458(k) (bitwise-AND of k and sigma(k)-k) is equal to k.at n=3A324897
• Odd numbers k such that sigma(k) is congruent to 2 modulo 4 and k = A318458(k), where A318458(k) is bitwise-AND of k and sigma(k)-k.at n=0A324898
• Odd nonsquares k for which A161942(k) >= k, where A161942 is the odd part of sigma.at n=6A348743
• E.g.f. satisfies A(x) = 1 + x*A(x)^4*exp(x*A(x)^2).at n=5A365176
• Odd nondeficient numbers of the form p^(1+4k) * r^2, where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1.at n=6A386427
• Odd numbers k for which A003961(k) > 2*k and A003961(k)-2*k OR A003961(k)-sigma(k) = A003961(k)-2*k, where OR is bitwise-or (A003986) and A003961 is fully multiplicative with a(p) = nextprime(p).at n=12A388029