The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062007 a(n) = mu(n)*prime(n). 1
 2, -3, -5, 0, -11, 13, -17, 0, 0, 29, -31, 0, -41, 43, 47, 0, -59, 0, -67, 0, 73, 79, -83, 0, 0, 101, 0, 0, -109, -113, -127, 0, 137, 139, 149, 0, -157, 163, 167, 0, -179, -181, -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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n=1..1000 MATHEMATICA Table[MoebiusMu[n]*Prime[n], {n, 100}] (* G. C. Greubel, May 03 2022 *) PROG (PARI) q=[]; for(n=1, 200, q=concat(q, moebius(n)*prime(n))); q (SageMath) [moebius(n)*nth_prime(n) for n in (1..100)] # G. C. Greubel, May 03 2022 CROSSREFS Cf. A000040, A008683. Sequence in context: A023049 A240979 A171034 * A031067 A300392 A335706 Adjacent sequences: A062004 A062005 A062006 * A062008 A062009 A062010 KEYWORD easy,sign AUTHOR Jason Earls, Jul 04 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 01:00 EST 2023. Contains 367565 sequences. (Running on oeis4.)