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

%I #6 Apr 19 2016 01:07:35

%S 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,

%T 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,

%U 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

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

%t 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 *)

%Y Cf. A103270.

%K nonn

%O 2,1

%A _Yasutoshi Kohmoto_, Apr 08 2005

%E More terms from _Robert G. Wilson v_, Apr 08 2005

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 July 26 16:15 EDT 2024. Contains 374635 sequences. (Running on oeis4.)