id:A103270 - OEIS Search Results

Search: id:A103270

Displaying 1-1 of 1 results found.

page 1

a(n)=prime(n)+prime(n+k) mod 4, where k=(1/2)*(prime(n+1)-prime(n)).

+0
2

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

	OFFSET	`2,10`
	COMMENT	`If {prime(n), prime(n+1)} are twin primes, then a(n)=0 because k=1, so a(n)=2*prime(n)+2=0, mod 4.`
	MAPLE	`a:=proc(n) local k: k:=(ithprime(n+1)-ithprime(n))/2: ithprime(n)+ithprime(n+k) mod 4 end: seq(a(n), n=2..130); (Deutsch)`
	CROSSREFS	`Sequence in context: A107329 A085859 A086016 this_sequence A087780 A082523 A083935` `Adjacent sequences: A103267 A103268 A103269 this_sequence A103271 A103272 A103273`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Jan 27 2005`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 31 2005`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research