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”).

A304327
Number of ways to write n as a product of a perfect power and a squarefree number.
10
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1
OFFSET
1,8
COMMENTS
First term greater than 2 is a(746496) = 3.
LINKS
EXAMPLE
The a(746496) = 3 ways are 12^5*3, 72^3*2, 864^2*1.
MATHEMATICA
Table[Length[Select[Divisors[n], (#===1||GCD@@FactorInteger[#][[All, 2]]>1)&&SquareFreeQ[n/#]&]], {n, 100}]
PROG
(PARI) A304327(n) = sumdiv(n, d, issquarefree(n/d)*((1==d)||ispower(d))); \\ Antti Karttunen, Jul 29 2018
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 10 2018
EXTENSIONS
More terms from Antti Karttunen, Jul 29 2018
STATUS
approved