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!)
A100566 2*a(n) = prime(prime(n)) + prime(prime(2n)). 1

%I #8 Mar 30 2012 17:34:14

%S 11,26,42,70,99,125,154,183,231,264,309,363,389,414,490,537,580,649,

%T 692,727,786,824,935,978,1023,1080,1128,1170,1220,1311,1401,1436,1533,

%U 1605,1647,1734,1807,1855,1917,1986,2053,2131,2200,2250,2312,2407,2501,2583

%N 2*a(n) = prime(prime(n)) + prime(prime(2n)).

%F a(n) = (A006450(n)+A006450(2n))/2.

%t A=Floor[Log[2]*n/Log[2]] B=Floor[2*Log[2]*n/Log[2]] f[n_]:=(Prime[Prime[A]]+Prime[Prime[B]])/2 digits=200 a=Table[f[n], {n, 2, digits}]

%Y Cf. A100567.

%K nonn

%O 2,1

%A _Roger L. Bagula_, Nov 28 2004

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 24 12:46 EDT 2024. Contains 371942 sequences. (Running on oeis4.)