OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
For example, 12 is composite and it has 6 divisors: 1, 2, 3, 4, 6, 12. Of these, 4 are not prime: 1, 4, 6, 12. Since 4 is not prime either, 12 is in the sequence.
MAPLE
filter:= n ->
not isprime(n) and not isprime(nops(remove(isprime, NumberTheory:-Divisors(n)))):
select(filter, [$1..1000]); # Robert Israel, Jun 01 2026
MATHEMATICA
NonPrimeDivisors[n_] := Length[Select[Divisors[n], ! PrimeQ[#] &]]; Select[Range[200], ! PrimeQ[#] && ! PrimeQ[NonPrimeDivisors[#]] &] (* T. D. Noe, Oct 20 2011 *)
PROG
(SageMath)
def npd(n: int) -> int:
return len([d for d in divisors(n) if not is_prime(d)])
def isA192690(n: int) -> bool:
return not (is_prime(n) or is_prime(npd(n)))
A192690List = lambda b: [n for n in range(1, b) if isA192690(n)]
print(A192690List(189)) # Peter Luschny, Apr 22 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Oct 15 2011
STATUS
approved
