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.

A085910 a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).

Original entry on oeis.org

5, 3, 13, 17, 7, 11, 37, 31, 41, 23, 19, 29, 67, 53, 47, 71, 73, 43, 59, 61, 97, 131, 359, 79, 107, 109, 101, 103, 293, 163, 83, 149, 181, 137, 157, 151, 127, 173, 167, 191, 139, 179, 223, 227, 211, 199, 193, 197, 277, 251, 269, 283, 233, 263, 257, 239, 331, 229, 311
Offset: 0

Views

Author

Amarnath Murthy, Jul 09 2003

Keywords

Comments

a(1) = 0. Conjecture: a rearrangement of odd primes for n > 1.

Crossrefs

Cf. A085909.

Extensions

Corrected and extended by David Wasserman, Feb 24 2004