OFFSET
1,1
COMMENTS
A signed multiplicative variant is defined by b(n) = a(n)*mu(n) with mu = A008683, such that b(p^e)=0 if e=1 and b(p^e)= -1 if e>1. This has Dirichlet series Sum_{n>=1} b(n)/n = A005596 and Sum_{n>=1} b(n)/n^2 = A065471. - R. J. Mathar, Apr 04 2011
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Powerful Number.
FORMULA
Multiplicative with a(p^e) = 1 - 0^(e-1), e > 0 and p prime.
Dirichlet g.f.: zeta(2*s)*zeta(3*s)/zeta(6*s), e.g., A082695 at s=1.
Sum_{k=1..n} a(k) ~ zeta(3/2)*sqrt(n)/zeta(3) + 6*zeta(2/3)*n^(1/3)/Pi^2. - Vaclav Kotesovec, Feb 08 2019
EXAMPLE
a(72) = 1 because 72 = 2^3*3^2 has all exponents > 1.
MATHEMATICA
cfpn[n_]:=If[n==1||Min[Transpose[FactorInteger[n]][[2]]]>1, 1, 0]; Array[ cfpn, 120] (* Harvey P. Dale, Jul 17 2012 *)
PROG
(Haskell)
a112526 1 = 1
a112526 n = fromEnum $ (> 1) $ minimum $ a124010_row n
-- Reinhard Zumkeller, Jun 03 2015, Sep 16 2011
(PARI) for(n=1, 100, print1(direuler(p=2, n, (1+X^3)/(1-X^2))[n], ", ")) \\ Vaclav Kotesovec, Jul 15 2022
(PARI) a(n) = ispowerful(n); \\ Amiram Eldar, Jul 02 2025
(Python)
from sympy import factorint
def A112526(n): return int(all(e>1 for e in factorint(n).values())) # Chai Wah Wu, Sep 15 2024
CROSSREFS
KEYWORD
mult,nonn,easy
AUTHOR
Franklin T. Adams-Watters, Sep 09 2005
STATUS
approved
