id:A007423 - OEIS Search Results

Search: id:A007423

Displaying 1-1 of 1 results found.

page 1

mu(n) + 1, where mu is the Moebius function.
(Formerly M0011)

+0
3

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; listen)

	OFFSET	`1,1`
	REFERENCES	`K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory. Springer-Verlag, NY, 1982, p. 19.` `G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 234.`
	CROSSREFS	`Cf. A008683.` `a(n) = abs(A007423(n))` `Adjacent sequences: A007420 A007421 A007422 this_sequence A007424 A007425 A007426` `Sequence in context: A129448 A123759 A072453 this_sequence A076544 A084143 A025888`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research