OFFSET
1,5
COMMENTS
F(n) = {d|n, d>=sqrt(n)}. S(d) = {x|x is a prime number<d, not(x | d)} then a(n) = Sum_{F(n)} card(S(d)). - Devansh Singh, Jun 16 2020
To say "d*p < n and not(d*p | n)" is equivalent to "p < d' and not(p | d')" where d' = n/d also runs over all divisors, whence the formula. - M. F. Hasler, Jun 16 2020
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = A000720(n)-1 = PrimePi(n)-1 when n is a prime number. [Corrected by M. F. Hasler]
a(n) = Sum_{d|n} primepi(d)-omega(d), where omega = A001221. - M. F. Hasler, Jun 16 2020
EXAMPLE
a(10)=4 : {3=1*3, 4=2*2, 6=2*3, 7=1*7}, where 1, 2, 5, are excluded because they are divisor of 10; 8 and 9 are excluded because they cannot be written as d*p.
PROG
(PARI) a(n) = #select(x->((x<n) && (n%x)), setbinop((x, y)->(x*y), divisors(n), select(x->isprime(x), [1..n]))); \\ Michel Marcus, May 13 2020
(PARI) apply( {A334800(n)=sumdiv(n, d, primepi(d)-omega(d))}, [1..99]) \\ M. F. Hasler, Jun 16 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Devansh Singh, May 12 2020
EXTENSIONS
More terms from Michel Marcus, May 13 2020
STATUS
approved