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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249767 a(n) = mu(n) + omega(n). 3
1, 0, 0, 1, 0, 3, 0, 1, 1, 3, 0, 2, 0, 3, 3, 1, 0, 2, 0, 2, 3, 3, 0, 2, 1, 3, 1, 2, 0, 2, 0, 1, 3, 3, 3, 2, 0, 3, 3, 2, 0, 2, 0, 2, 2, 3, 0, 2, 1, 2, 3, 2, 0, 2, 3, 2, 3, 3, 0, 3, 0, 3, 2, 1, 3, 2, 0, 2, 3, 2, 0, 2, 0, 3, 2, 2, 3, 2, 0, 2, 1, 3, 0, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

The 0 terms identify for the prime numbers.

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

MATHEMATICA

Table[MoebiusMu[k] + PrimeNu[k], {k, 200}]

PROG

(PARI) for(n=1, 50, print1(moebius(n) + omega(n), ", ")) \\ G. C. Greubel, May 17 2017

CROSSREFS

Equals Mobius function (A008683) + omega function (A001221).

Cf. A249901.

Sequence in context: A069023 A275336 A091614 * A174433 A174624 A029358

Adjacent sequences:  A249764 A249765 A249766 * A249768 A249769 A249770

KEYWORD

nonn

AUTHOR

Ke Xiao, Jan 13 2015

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 July 23 00:43 EDT 2019. Contains 325228 sequences. (Running on oeis4.)