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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080847 a(n) = mu(n)+2, where mu is the Moebius function (A008683). 5
3, 1, 1, 2, 1, 3, 1, 2, 2, 3, 1, 2, 1, 3, 3, 2, 1, 2, 1, 2, 3, 3, 1, 2, 2, 3, 2, 2, 1, 1, 1, 2, 3, 3, 3, 2, 1, 3, 3, 2, 1, 1, 1, 2, 2, 3, 1, 2, 2, 2, 3, 2, 1, 2, 3, 2, 3, 3, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 2, 3, 1, 2, 3, 3, 3, 2, 1, 2, 3, 2, 3, 3, 3, 2, 1, 2, 2, 2, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

1 <= a(n) <= 3.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..5000

Index entries for sequences computed from exponents in factorization of n

MATHEMATICA

MoebiusMu[Range[120]]+2 (* Harvey P. Dale, Dec 31 2021 *)

PROG

(define (A080847 n) (+ 2 (A008683 n))) ;; Antti Karttunen, Jul 26 2017

CROSSREFS

Cf. A008683, one more than A007423, one less than A231821.

Cf. A080848, A080849.

Sequence in context: A242248 A107297 A107296 * A326406 A334006 A270572

Adjacent sequences: A080844 A080845 A080846 * A080848 A080849 A080850

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Feb 20 2003

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 November 28 12:20 EST 2022. Contains 358416 sequences. (Running on oeis4.)