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.

A137467 a(n) = i + j - k, where n = p(i) + p(j) - p(k), such that p(i), p(j), and p(k) are distinct primes, i + j - k = minimum, and n >= 3.

Original entry on oeis.org

1, 2, 3, 2, 3, 3, 4
Offset: 3

Views

Author

Ctibor O. Zizka, Apr 19 2008

Keywords

Comments

Is it true for all n : n = p(i) + p(j) - p(k)?

Examples

			For n = 6, 6 = p(1) + p(5) - p(4) = 2 + 11 - 7; so a(6) = 1 + 5 - 4 = 2.
		

Crossrefs