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!)
A141030 a(n)=If[Prime[n + 1]^2 - Prime[n]*Prime[n + 2] > 0, If[Mod[Prime[n]*Sqrt[5], 1] >= 0.5, 0, 1], If[Mod[Prime[n]*Sqrt[7], 1] >= 0.5, 2, 3]]. 0

%I #7 Dec 18 2022 07:04:32

%S 3,0,3,0,3,1,2,3,1,2,1,0,3,2,1,0,3,1,0,2,1,3,2,1,0,3,1,3,3,0,3,0,3,0,

%T 3,0,1,3,1,0,2,0,3,0,3,0,0,0,2,2,1,3,0,1,0,1,2,0,1,3,2,1,1,2,3,0,2,0,

%U 3,3,2,0,0,1,2,3,0,3,2,0,2,1,3,1,3,3,0,0,2,2,1,1,3,0,3,2,1,3,1,3

%N a(n)=If[Prime[n + 1]^2 - Prime[n]*Prime[n + 2] > 0, If[Mod[Prime[n]*Sqrt[5], 1] >= 0.5, 0, 1], If[Mod[Prime[n]*Sqrt[7], 1] >= 0.5, 2, 3]].

%t f[n_] = If[Prime[n + 1]^2 - Prime[n]*Prime[n + 2] > 0, If[Mod[Prime[n]*Sqrt[5], 1] >= 0.5, 0, 1], If[Mod[Prime[n]*Sqrt[7], 1] >= 0.5, 2, 3]];

%t Table[f[n], {n, 1, 100}]

%K nonn,uned,less

%O 1,1

%A _Roger L. Bagula_, Jul 30 2008

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)