OFFSET
1,1
COMMENTS
We define a divisor d|n to be inferior if d <= n/d. Inferior divisors are counted by A038548 and listed by A161906.
Numbers n with an odd prime factor <= sqrt(n). - Chai Wah Wu, Mar 09 2021
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
The divisors > 1 of 72 are {2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72}, of which {3, 9} are odd and {2, 3, 4, 6, 8} are inferior, with intersection {3}, so 72 is in the sequence.
MATHEMATICA
Select[Range[100], Function[n, Select[Divisors[n]//Rest, OddQ[#]&&#<=n/#&]!={}]]
PROG
(Python)
from sympy import primefactors
A342082_list = [n for n in range(1, 10**3) if len([p for p in primefactors(n) if p > 2 and p*p <= n]) > 0] # Chai Wah Wu, Mar 09 2021
(PARI) is(n) = #select(x -> x > 2 && x^2 <= n, factor(n)[, 1]) > 0; \\ Amiram Eldar, Nov 01 2024
CROSSREFS
The strictly inferior version is the same with A001248 removed.
Positions of terms > 1 in A069288.
The complement is A342081.
A006530 selects the greatest prime factor.
A020639 selects the smallest prime factor.
- Odd -
A001227 counts odd divisors.
A026424 lists numbers with odd Omega.
A027193 counts odd-length partitions.
A058695 counts partitions of odd numbers.
A341594 counts strictly superior odd divisors
A341675 counts superior odd divisors.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Mar 06 2021
STATUS
approved