cp's OEIS Frontend

A253141 If n is a prime power, then a(n) = lambda(tau(n)) = A014963(A000005(n)); otherwise, a(n) = 1.

%I A253141 #16 Jul 19 2017 20:09:16
%S A253141 1,2,2,3,2,1,2,2,3,1,2,1,2,1,1,5,2,1,2,1,1,1,2,1,3,1,2,1,2,1,2,1,1,1,
%T A253141 1,1,2,1,1,1,2,1,2,1,1,1,2,1,3,1,1,1,2,1,1,1,1,1,2,1,2,1,1,7,1,1,2,1,
%U A253141 1,1,2,1,2,1,1,1,1,1,2,1,5,1,2,1,1,1,1
%N A253141 If n is a prime power, then a(n) = lambda(tau(n)) = A014963(A000005(n)); otherwise, a(n) = 1.
%C A253141 For any integer sequence a, the sequence b such that b(n) = Product_{d|n} a(d) is a divisibility sequence. Since A253139(n) = Product_{d|n} a(d), A253139 is a divisibility sequence.
%C A253141 a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).
%H A253141 Antti Karttunen, <a href="/A253141/b253141.txt">Table of n, a(n) for n = 1..10000</a>
%H A253141 Morgan Ward, <a href="https://doi.org/10.1090/S0002-9904-1939-06980-2">A note on divisibility sequences</a>, Bull. Amer. Math. Soc., 45 (1939), 334-336.
%H A253141 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%e A253141 2 is a prime number, i.e., a prime power with 2 divisors; a(2) = A014963(2) = 2.
%e A253141 6 = 2*3 is not a prime power; a(6) = 1.
%e A253141 8 = 2^3 is a prime power with 4 divisors; a(8) = A014963(4) = 2.
%e A253141 32 = 2^5 is a prime power with 6 divisors; a(32) = A014963(6) = 1.
%t A253141 Table[If[PrimePowerQ[n], Exp[MangoldtLambda[DivisorSigma[0, n]]], 1], {n, 1, 100}] (* _Indranil Ghosh_, Jul 19 2017 *)
%o A253141 (PARI)
%o A253141 A014963(n) = ispower(n, , &n); if(isprime(n), n, 1); \\ This function from _Charles R Greathouse IV_, Jun 10 2011
%o A253141 A253141(n) = if(1==omega(n), A014963(numdiv(n)), 1); \\ _Antti Karttunen_, Jul 19 2017
%Y A253141 Cf. A000005, A014963, A253139.
%K A253141 nonn,easy
%O A253141 1,2
%A A253141 _Matthew Vandermast_, Dec 27 2014