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

a(n) = mu(n)*prime(n).
1

%I #18 May 24 2022 02:26:44

%S 2,-3,-5,0,-11,13,-17,0,0,29,-31,0,-41,43,47,0,-59,0,-67,0,73,79,-83,

%T 0,0,101,0,0,-109,-113,-127,0,137,139,149,0,-157,163,167,0,-179,-181,

%U -191,0,0,199,-211,0,0,0,233,0,-241,0,257,0,269,271,-277,0,-283,293,0,0,313,-317,-331,0,347,-349,-353,0,-367,373,0

%N a(n) = mu(n)*prime(n).

%H Harry J. Smith, <a href="/A062007/b062007.txt">Table of n, a(n) for n=1..1000</a>

%t Table[MoebiusMu[n]*Prime[n], {n, 100}] (* _G. C. Greubel_, May 03 2022 *)

%o (PARI) q=[]; for(n=1,200,q=concat(q,moebius(n)*prime(n))); q

%o (SageMath) [moebius(n)*nth_prime(n) for n in (1..100)] # _G. C. Greubel_, May 03 2022

%Y Cf. A000040, A008683.

%K easy,sign

%O 1,1

%A _Jason Earls_, Jul 04 2001