id:A133639 - OEIS Search Results

Search: id:A133639

Displaying 1-1 of 1 results found.

page 1

Mobius transform of b(n) where b(8n+1) = A080995(n).

+0
1

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

	OFFSET	`1,1`
	FORMULA	`a(n) is multiplicative with a(2^e) = a(3^e) = -1 if e=1, 0 if e>1, a(p^e) = (-1)^e if p > 3.` `a(4n) = a(9n) = 0.`
	PROGRAM	`(PARI) {a(n) = local(A, p, e); if( n<1, 0, A = factor(n); prod(k = 1, matsize(A) [1], if(p = A[k, 1], e = A[k, 2]; if(p < 5, -(e==1), (-1)^e ))))}`
	CROSSREFS	`Sequence in context: A008966 A080323 A069158 this_sequence A060038 A132350 A120525` `Adjacent sequences: A133636 A133637 A133638 this_sequence A133640 A133641 A133642`
	KEYWORD	`sign,mult`
	AUTHOR	`Michael Somos, Sep 14 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research