cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A074766 a(n) = prime(2n) - 2*prime(n) - n.

Original entry on oeis.org

-2, -1, 0, 1, 2, 5, 2, 7, 6, 3, 6, 3, 6, 7, 4, 9, 4, 11, 10, 11, 14, 13, 10, 21, 10, 11, 18, 21, 24, 25, 8, 17, 10, 25, 16, 21, 22, 19, 24, 23, 22, 29, 18, 27, 24, 35, 22, 9, 18, 33, 40, 39, 42, 37, 32, 31, 24, 41, 34, 37, 46, 35, 24, 33, 42, 43, 28, 27, 24, 41, 44, 37, 32, 37, 30, 39, 32
Offset: 1

Views

Author

Werner D. Sand, Sep 29 2002

Keywords

Comments

Conjecture: p(2n) - 2p(n) < 2n for all n.

Examples

			a(9) = p(18) - 2p(9) - 9 = 61 - 2*23 - 9 = 6.
		

Crossrefs

Cf. A066066.

Programs

Formula

a(n) = A066066(n) - n.