login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A327517
Number of factorizations of n that are empty or have at least two factors, all of which are > 1 and pairwise coprime.
6
1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 4, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 4, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 4, 0, 1, 1, 0, 1, 4, 0, 1, 1, 4, 0, 1, 0, 1, 1, 1, 1, 4, 0, 1, 0, 1, 0, 4, 1, 1, 1
OFFSET
1,30
FORMULA
a(n > 1) = A259936(n) - 1 = A000110(A001221(n)) - 1.
MATHEMATICA
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
Table[Length[Select[facs[n], #=={}||CoprimeQ@@#&]], {n, 100}]
CROSSREFS
See link for additional cross-references.
Sequence in context: A200627 A152889 A216273 * A376504 A151905 A226997
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 19 2019
STATUS
approved