OFFSET
1,6
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
PROG
(PARI) a(n) = sum(i=1, n, numdiv(i*n)==6); \\ Michel Marcus, Nov 11 2020
(Python)
from collections import Counter
from sympy import factorint
def A338714(n):
f = Counter(factorint(n))
return sum(1 for i in range(1, n+1) if (l:=tuple(sorted((f+Counter(factorint(i))).values())))==(1, 2) or l==(5, )) # Chai Wah Wu, Oct 14 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 11 2020
STATUS
approved