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.

A140199 a(n) = the number of pairs of (not necessarily distinct) positive integers j and k where j <= n and k <= n such that k+j is prime.

Original entry on oeis.org

1, 2, 3, 5, 6, 8, 10, 12, 15, 19, 22, 26, 29, 32, 36, 41, 45, 49, 53, 57, 62, 68, 73, 79, 85, 91, 98, 105, 111, 118, 125, 132, 139, 147, 155, 164, 173, 182, 191, 201, 210, 220, 229, 238, 248, 258, 267, 276, 286, 296, 307, 319, 330, 342, 355, 368, 382, 396, 409, 422
Offset: 1

Views

Author

Leroy Quet, Jun 15 2008

Keywords

Examples

			For n = 4 there are 5 pairs of positive integers, each <= n=4, that sum to a prime: 1+1=2, 1+2=3, 2+3=5, 1+4=5 and 3+4=7.
		

Crossrefs

Programs

Formula

a(n) = sum{k=1 to n} A108954(k). (A108954(n) = pi(2n)-pi(n), where pi(n) is the number of primes that are <= n). a(n) = A071917(n)+1.

Extensions

More terms from R. J. Mathar, Jun 19 2008