login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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
11, 17, 61, 61, 205, 205, 421, 573, 585, 1185, 1173, 1501, 2005, 2349, 2737, 2985, 4185, 4173, 4741, 5889, 5877, 7173, 8181, 8569, 9781, 11005, 11005, 12301, 14917, 13477, 17637, 17649, 21505, 19777, 23985, 24577, 25869, 28509, 29857, 30585, 35617 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

REFERENCES

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

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

CROSSREFS

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

Sequence in context: A217064 A242244 A228031 * A250716 A244853 A102870

Adjacent sequences:  A324792 A324793 A324794 * A324796 A324797 A324798

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 10 2019

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 04:46 EST 2019. Contains 329853 sequences. (Running on oeis4.)