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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007423 a(n) = mu(n) + 1, where mu is the Moebius function.
(Formerly M0011)
7
2, 0, 0, 1, 0, 2, 0, 1, 1, 2, 0, 1, 0, 2, 2, 1, 0, 1, 0, 1, 2, 2, 0, 1, 1, 2, 1, 1, 0, 0, 0, 1, 2, 2, 2, 1, 0, 2, 2, 1, 0, 0, 0, 1, 1, 2, 0, 1, 1, 1, 2, 1, 0, 1, 2, 1, 2, 2, 0, 1, 0, 2, 1, 1, 2, 0, 0, 1, 2, 0, 0, 1, 0, 2, 1, 1, 2, 0, 0, 1, 1, 2, 0, 1, 2, 2, 2, 1, 0, 1, 2, 1, 2, 2, 2, 1, 0, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 234.
K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory. Springer-Verlag, NY, 1982, p. 19.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
MAPLE
with(numtheory); A007423:=n->mobius(n)+1; seq(A007423(k), k=1..100); # Wesley Ivan Hurt, Oct 24 2013
MATHEMATICA
MoebiusMu[Range[100]]+1 (* Harvey P. Dale, Nov 08 2011 *)
PROG
(Haskell)
a007423 = (+ 1) . a008683 -- Reinhard Zumkeller, Jul 30 2014
(PARI) a(n)=moebius(n)+1 \\ Charles R Greathouse IV, Feb 25 2018
CROSSREFS
Cf. A008683.
a(n) = abs(A007423(n))
Sequence in context: A324252 A321445 A353459 * A076544 A349912 A345079
KEYWORD
easy,nonn,nice
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)