id:A099991 - OEIS Search Results

Search: id:A099991

Displaying 1-1 of 1 results found.

page 1

Moebius(2n).

+0
2

-1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 0, 0, -1, 0, 1, 0, 0, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`b(n) = -a(n) is multiplicative with b(2^e) = 0, b(p^1) = -1 if p >= 3, 0 otherwise. David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	MATHEMATICA	`lst={}; Do[AppendTo[lst, MoebiusMu[n]], {n, 0, 6!, 2}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 20 2008]`
	CROSSREFS	`Bisection of A008683. Cf. A099990.` `Sequence in context: A004569 A100060 A147850 this_sequence A091069 A087003 A104606` `Adjacent sequences: A099988 A099989 A099990 this_sequence A099992 A099993 A099994`
	KEYWORD	`sign,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 20 2004`

page 1

Search completed in 0.003 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research