id:A005088 - OEIS Search Results

Search: id:A005088

Displaying 1-1 of 1 results found.

page 1

Number of primes = 1 mod 3 dividing n.

+0
4

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

	OFFSET	`1,1`
	LINKS	`S. R. Finch and Pascal Sebah, Squares and Cubes Modulo n (arXiv: math.NT/0604465).`
	FORMULA	`Additive with a(p^e) = 1 if p = 1 (mod 3), 0 otherwise.`
	CROSSREFS	`Adjacent sequences: A005085 A005086 A005087 this_sequence A005089 A005090 A005091` `Sequence in context: A025459 A079365 A037822 this_sequence A011686 A070108 A011675`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research