login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
2,1
LINKS
MATHEMATICA
f[n_] := Mod[Prime[n] + Prime[n + (Prime[n + 1] - Prime[n])/2], 3]; Table[ f[n], {n, 2, 106}] (* Robert G. Wilson v, Apr 08 2005 *)
CROSSREFS
Cf. A103270.
Sequence in context: A158777 A039970 A179212 * A245359 A103271 A029832
KEYWORD
nonn
AUTHOR
Yasutoshi Kohmoto, Apr 08 2005
EXTENSIONS
More terms from Robert G. Wilson v, Apr 08 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)