|
|
A327513
|
|
Number of divisors of n that are 1, 2, or a nonprime number whose prime indices are pairwise coprime.
|
|
3
|
|
|
1, 2, 1, 3, 1, 3, 1, 4, 1, 3, 1, 5, 1, 3, 2, 5, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 6, 1, 6, 2, 3, 2, 5, 1, 3, 1, 7, 1, 4, 1, 5, 2, 3, 1, 9, 1, 3, 2, 5, 1, 3, 2, 7, 1, 3, 1, 10, 1, 3, 1, 7, 1, 6, 1, 5, 2, 6, 1, 7, 1, 3, 2, 5, 2, 4, 1, 9, 1, 3, 1, 7, 2, 3, 1, 7, 1, 6, 1, 5, 2, 3, 2, 11, 1, 3, 2, 5, 1, 6, 1, 7, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers that are 1, 2, or a nonprime number whose prime indices are pairwise coprime are listed in A302696.
Note that the maximum odd divisor of any entry must be squarefree.
Number of terms of A302696 that divide n. Put in other words, this sequence is the inverse Möbius transform of the characteristic function of A302696. - Antti Karttunen, Dec 06 2021
|
|
LINKS
|
|
|
EXAMPLE
|
The divisors of 72 that are 1, 2, or nonprime numbers whose prime indices are pairwise coprime are: {1, 2, 4, 6, 8, 12, 24}, so a(72) = 7.
|
|
MATHEMATICA
|
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Table[Length[Select[Divisors[n], #==1||CoprimeQ@@primeMS[#]&]], {n, 100}]
|
|
PROG
|
(PARI)
isA302696(n) = if(isprimepower(n), !(n%2), if(!issquarefree(n>>valuation(n, 2)), 0, my(pis=apply(primepi, factor(n)[, 1])); (lcm(pis)==factorback(pis))));
|
|
CROSSREFS
|
See link for additional cross-references.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|