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.

A113833 Triangle read by rows: row n (n>=2) gives a set of n primes such that the averages of all subsets are distinct primes, having the smallest largest element.

Original entry on oeis.org

3, 7, 7, 19, 67, 5, 17, 89, 1277, 209173, 322573, 536773, 1217893, 2484733
Offset: 2

Views

Author

N. J. A. Sloane, Jan 25 2006

Keywords

Comments

If there is more than one set with the same smallest last element, choose the lexicographically earliest solution.
Note that, in each row, the n primes are equal modulo 4, 12, 12 and 120, respectively. - Row 5 from T. D. Noe, Aug 08 2006

Examples

			Triangle begins:
3, 7
7, 19, 67
5, 17, 89, 1277
		

References

  • Antal Balog, The prime k-tuplets conjecture on average, in "Analytic Number Theory" (eds. B. C. Berndt et al.) Birkhäuser, Boston, 1990, pp. 165-204. [Background]

Crossrefs

Extensions

Row 5 from T. D. Noe, Aug 08 2006