id:A129667 - OEIS Search Results

Search: id:A129667

Displaying 1-1 of 1 results found.

page 1

Dirichlet inverse of the Abelian group count (A000688).

+0
1

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

	OFFSET	`1,1`
	COMMENT	`The simple formula which gives the value of this multiplicative function for the power of any prime can be derived from Euler's celebrated "Pentagonal Number Theorem" (applied to the generating function of the partition function A000041 on which A000688 is based).`
	LINKS	`G. P. Michon, Partition Function and Pentagonal Numbers.` `G. P. Michon, Multiplicative Functions.`
	FORMULA	`Multiplicative function for which a(p^e) either vanishes or is equal to (-1)^n, for any prime p, if e is either n(3n-1)/2 or n(3n+1)/2 (these integers are the pentagonal numbers of the first and second kind, A000326 and A005449).`
	EXAMPLE	`a(8) and a(27) are zero because the sequence vanishes for the cubes of primes. Not so with fifth powers of primes (since 5 is a pentagonal number) so a(32) is nonzero.`
	CROSSREFS	`Cf. A000041, A000326, A000688, A005449, A023900, A101035.` `Sequence in context: A119981 A115789 A053864 this_sequence A071374 A077010 A070887` `Adjacent sequences: A129664 A129665 A129666 this_sequence A129668 A129669 A129670`
	KEYWORD	`mult,easy,sign`
	AUTHOR	`Gerard P. Michon (g.michon(AT)att.net), Apr 28 2007, May 01 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research