id:A065339 - OEIS Search Results

Search: id:A065339

Displaying 1-1 of 1 results found.

page 1

Number of primes congruent to 3 modulo 4 dividing n (with multiplicity).

+0
7

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

	OFFSET	`1,9`
	COMMENT	`(2^A007814(n)) * (3^a(n)) = A065338(n).`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	CROSSREFS	`Cf. A065338, A005091, A007949, A083025.` `Sequence in context: A091586 A116377 A131964 this_sequence A122434 A113706 A054845` `Adjacent sequences: A065336 A065337 A065338 this_sequence A065340 A065341 A065342`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Oct 29 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research