|
Search: id:A007421
|
|
|
| A007421 |
|
Liouville's function: parity of number of primes dividing n (with multiplicity).
(Formerly M0067)
|
|
+0
3
|
|
| 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
R. S. Lehman, On Liouville's function, Math. Comp., 14 (1960), 311-320.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 279.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
FORMULA
|
((-1)^bigomega(n)+3)/2, where bigomega(n) is the number of prime divisors of the integer n counted with multiplicity.
|
|
CROSSREFS
|
Cf. A008836.
A065043(n) + 1.
Sequence in context: A055443 A003842 A095771 this_sequence A103921 A115623 A134265
Adjacent sequences: A007418 A007419 A007420 this_sequence A007422 A007423 A007424
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 01 2001
|
|
|
Search completed in 0.002 seconds
|
