The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324795 a(n) = 2*p(n)*p(n+2)-p(n+1)^2 where p(k) = k-th prime. 2

%I

%S 11,17,61,61,205,205,421,573,585,1185,1173,1501,2005,2349,2737,2985,

%T 4185,4173,4741,5889,5877,7173,8181,8569,9781,11005,11005,12301,14917,

%U 13477,17637,17649,21505,19777,23985,24577,25869,28509,29857,30585,35617

%N a(n) = 2*p(n)*p(n+2)-p(n+1)^2 where p(k) = k-th prime.

%C Theorem: a(n)>0. Proof: Use p(n+1) <= 2 p(n)^2 for n>4. (See Mitrinovic). QED

%D D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section VII.18(b).

%H Seiichi Manyama, <a href="/A324795/b324795.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A056221 (if leading coefficient 2 is changed to 1), A327447 or A309487 (if 2 is changed to 4).

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Sep 10 2019

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

Last modified January 20 19:53 EST 2020. Contains 331096 sequences. (Running on oeis4.)