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!)
A109556 a(n) = If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 2, Prime[n]]. 2

%I #2 Mar 30 2012 17:34:19

%S 3,5,11,17,79,97,103,109,127,163,193,223,229,277,307,313,349,379,397,

%T 439,457,463,487,499,613,643,677,727,733,751,941,947,971,977,991,1013,

%U 1033,1063,1097,1103,1117,1123,1181,1187,1217,1223,1231,1283,1291,1321

%N a(n) = If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 2, Prime[n]].

%t a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 2, Prime[n], {}], {n, 1, 400}]]

%Y Cf. A001359.

%K nonn

%O 0,1

%A _Roger L. Bagula_, Jun 27 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 August 14 11:22 EDT 2024. Contains 375159 sequences. (Running on oeis4.)