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.

A290400 Primes p such that Diophantine equation x + y + z = p with x*y*z = k^3 (0 < x <= y <= z) has a unique solution.

Original entry on oeis.org

3, 7, 13, 17, 19, 23, 29, 37, 53, 71, 101, 149, 157, 317, 347
Offset: 1

Views

Author

XU Pingya, Jul 29 2017

Keywords

Examples

			7 is in the sequence since, of the triples whose sum is 7, i.e., (1, 1, 5), (1, 2, 4), (1, 3, 3), and (2, 2, 3), only one (i.e., (1, 2, 4)), yields a cube as its product: 1 * 2 * 4 = 8 = 2^3.
31 is not here, since the corresponding equation has two solutions: (1, 5, 25) and (1, 12, 18).
		

Crossrefs