login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007423 mu(n) + 1, where mu is the Moebius function.
(Formerly M0011)
6
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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

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: A307303 A324252 A321445 * A076544 A307377 A323882

Adjacent sequences:  A007420 A007421 A007422 * A007424 A007425 A007426

KEYWORD

easy,nonn,nice

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 18:39 EST 2019. Contains 329323 sequences. (Running on oeis4.)