id:A071839 - OEIS Search Results

Search: id:A071839

Displaying 1-1 of 1 results found.

page 1

Number of primes == 1 mod 8 <= n.

+0
1

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

	OFFSET	`1,41`
	PROGRAM	`(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-1)%8, 0, 1)), ", "))`
	CROSSREFS	`Sequence in context: A098391 A071702 A076303 this_sequence A163857 A111893 A121902` `Adjacent sequences: A071836 A071837 A071838 this_sequence A071840 A071841 A071842`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 08 2002`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research