id:A105118 - OEIS Search Results

Search: id:A105118

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`2,1`
	MATHEMATICA	`f[n_] := Mod[Prime[n] + Prime[n + (Prime[n + 1] - Prime[n])/2], 3]; Table[ f[n], {n, 2, 106}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 08 2005)`
	CROSSREFS	`Cf. A103270.` `Sequence in context: A138108 A158777 A039970 this_sequence A103271 A029832 A026611` `Adjacent sequences: A105115 A105116 A105117 this_sequence A105119 A105120 A105121`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Apr 08 2005`
	EXTENSIONS	`More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 08 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research