OFFSET
1,1
COMMENTS
There exist numbers which are the product of two S-primes in exactly 1, 2, and 3 ways; however, it is unknown if any numbers exist which are the product of two S-primes in exactly 4 ways.
LINKS
Zachary DeStefano, Table of n, a(n) for n = 1..3786
FORMULA
a(n) == 1 (mod 4). - Hugo Pfoertner, May 01 2021
EXAMPLE
153 = 9*17 which are both S-primes, and admits no other S-prime factorizations.
PROG
(PARI) \\ uses is(n) from A057948
isok(n) = sumdiv(n, d, (d<=n/d) && is(d) && is(n/d)) == 1; \\ Michel Marcus, May 01 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Zachary DeStefano, Apr 30 2021
STATUS
approved