id:A103272 - OEIS Search Results

Search: id:A103272

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`2,3`
	MATHEMATICA	`Do[k = (Prime[n+1] - Prime[n])/2; Print[Mod[Prime[n-k]+Prime[n], 4]], {n, 3, 100}] (Propper)`
	CROSSREFS	`Sequence in context: A065600 A029583 A011289 this_sequence A065710 A089799 A073464` `Adjacent sequences: A103269 A103270 A103271 this_sequence A103273 A103274 A103275`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Jan 27 2005`
	EXTENSIONS	`More terms from Ryan Propper (rpropper(AT)stanford.edu) and David Wasserman (dwasserm(AT)earthlink.net), Oct 07 2005`

page 1

Search completed in 0.029 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research