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.

A092163 a(n) = prime(2n) + prime(2n+1).

Original entry on oeis.org

8, 18, 30, 42, 60, 78, 90, 112, 128, 144, 162, 186, 204, 216, 240, 268, 288, 308, 330, 352, 372, 390, 410, 450, 462, 480, 508, 532, 548, 564, 600, 624, 648, 684, 702, 726, 752, 772, 798, 828, 852, 872, 892, 918, 930, 966, 990, 1012, 1044, 1088, 1120, 1140
Offset: 1

Views

Author

Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Mar 31 2004

Keywords

Examples

			a(1) = 8 because p(2)= 3 and p(3) = 5.
a(2) = 18 because p(4)= 7 and p(5) = 11.
a(3) = 30 because p(6)= 13 and p(7) = 17.
		

Crossrefs

Programs

Formula

a(n) = A001043(2*n). - R. J. Mathar, Apr 20 2009
a(n) = 2*A058296(n+1). - Hugo Pfoertner, Aug 11 2025

Extensions

More terms from Robert G. Wilson v, Apr 22 2004