%I #15 Aug 28 2023 08:25:44
%S 1,0,0,2,0,0,0,1,2,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,2,0,1,0,0,0,0,1,0,0,
%T 0,4,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,
%U 0,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,2
%N Number of times n occurs in A197863.
%H Antti Karttunen, <a href="/A197881/b197881.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F Multiplicative with a(p^e) = 0 if e = 1, 2 if e = 2, and 1 otherwise.
%t f[p_, e_] := Switch[e, 1, 0, 2, 2, _, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Aug 28 2023 *)
%o (PARI) a(n)=my(es=factor(n)[,2]~);prod(k=1,#es,if(es[k]==1,0,if(es[k]==2,2,1)))
%o (Scheme) (define (A197881 n) (cond ((= 1 n) n) (else (* (case (A067029 n) ((1) 0) ((2) 2) (else 1)) (A197881 (A028234 n)))))) ;; _Antti Karttunen_, Jul 23 2017
%Y Cf. A197863, A112526.
%K nonn,easy,mult
%O 1,4
%A _Franklin T. Adams-Watters_, Oct 18 2011
%E More terms from _Antti Karttunen_, Jul 23 2017