id:A005090 - OEIS Search Results

Search: id:A005090

Displaying 1-1 of 1 results found.

page 1

Number of primes = 2 mod 3 dividing n.

+0
1

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

	OFFSET	`1,10`
	FORMULA	`Additive with a(p^e) = 1 if p = 2 (mod 3), 0 otherwise.`
	CROSSREFS	`Adjacent sequences: A005087 A005088 A005089 this_sequence A005091 A005092 A005093` `Sequence in context: A037800 A138253 A085737 this_sequence A073490 A135341 A033665`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research