id:A062157 - OEIS Search Results

Search: id:A062157

Displaying 1-1 of 1 results found.

page 1

0^n-(-1)^n.

+0
4

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

	OFFSET	`0,1`
	FORMULA	`a(n) =A000007(n)-A033999(n) =A062160(0, n). G.f.: x/(1+x).` `a(n)=-[(n+2) mod (n+1)](-1)^n, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Aug 28 2007` `Euler transform of length 2 sequence [ -1, 1]. - Michael Somos Jul 05 2009` `Moebius transform is length 2 sequence [ 1, -2]. - Michael Somos Jul 05 2009` `a(n) is multiplicative with a(2^e) = -1 if e>0, a(p^e) = 1 if p>2. - Michael Somos Jul 05 2009` `Dirichlet g.f.: zeta(s) (1 - 2^(1-s)). - Michael Somos Jul 05 2009`
	PROGRAM	`(PARI) {a(n) = if( n<1, 0, -(-1)^n )} /* Michael Somos Jul 05 2009 */`
	CROSSREFS	`Convolution inverse of A019590.` `Sequence in context: A103131 A057427 A057428 this_sequence A112347 A134824 A000007` `Adjacent sequences: A062154 A062155 A062156 this_sequence A062158 A062159 A062160`
	KEYWORD	`easy,sign,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 08 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research