login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105118 a(n)=prime(n)+prime(n+k) mod 3, where k=(1/2)*(prime(n+1)-prime(n)). 0
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; refs; listen; history; internal format)
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: A158777 A039970 A179212 * A103271 A029832 A174479

Adjacent sequences:  A105115 A105116 A105117 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 08:39 EST 2012. Contains 205998 sequences.