id:A074381 - OEIS Search Results

Search: id:A074381

Displaying 1-1 of 1 results found.

page 1

(p-1)/2 mod 2, where p is the n-th prime for which p+2 is also prime; i.e. a(n)=0 if p==1 (mod 4), a(n)=1 if p==3 (mod 4).

+0
1

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

	OFFSET	`1,1`
	MATHEMATICA	`Mod[(Select[Prime/@Range[600], PrimeQ[ #+2]&]-1)/2, 2]`
	CROSSREFS	`Cf. A001359, A071695, A071698.` `Sequence in context: A015029 A014789 A014669 this_sequence A128407 A134286 A023531` `Adjacent sequences: A074378 A074379 A074380 this_sequence A074382 A074383 A074384`
	KEYWORD	`nonn,easy`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 24 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean(AT)math.ucdavis.edu) and Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 09 2002`

page 1

Search completed in 0.002 seconds

Last modified September 4 21:24 EDT 2008. Contains 143414 sequences.

AT&T Labs Research