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.

A212294 Sums of (zero or more) distinct twin primes.

Original entry on oeis.org

0, 3, 5, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74
Offset: 1

Views

Author

Keywords

Comments

Assuming a Bertrand-like result for twin primes, that for every n > 3 there is a prime n < p < 2n such that either p-2 or p+2 is prime, the only missing terms are 1, 2, 4, 6, and 9.

Crossrefs

Cf. A208572.

Formula

Conjecturally, a(n) = n+4 for n > 5. This holds at least up to 2^500.