A086860 -id:A086860 - cp's OEIS frontend

A086888 a(n)=sqrt(s^2 - 4*p) where s=A086533(n), p=A086860(n).

9, 57, 57, 95, 9, 99, 147, 177, 63, 225, 231, 243, 177, 279, 411, 441, 291, 57, 441, 411, 381, 651, 609, 441, 669, 355, 267, 531, 801, 693, 789, 417, 711, 897, 477, 155

Offset: 1

Lekraj Beedassy, Sep 17 2003

More terms from Ray Chandler, Oct 23 2003

A086533 Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473.

Original entry on oeis.org

17, 65, 89, 127, 137, 163, 179, 185, 191, 233, 247, 269, 305, 343, 427, 457, 547, 569, 583, 613, 637, 667, 673, 697, 733, 757, 779, 787, 817, 821, 853, 929, 967, 977, 989, 997, 1045, 1087, 1117, 1207, 1267, 1273, 1289, 1297, 1327, 1345, 1357

Offset: 1

Lekraj Beedassy, Sep 10 2003

nonn

The first term is the sum solution of Martin Gardner's "Impossible Problem" for numbers each with an upper bound anywhere between 62 and 100.

M. Gardner,"Mathematical Games" Problem 1 pp. 20, 23-24 in Scientific American, Dec. 1979.

G. Darby, Know, Don't Know Problem.
R. V. Gassel et al., To Know, or Not To Know.
K. Uhland, A Great Puzzle.

For the corresponding (unique) products see A086860.
The number pairs are given by {a(n) -+ A086888(n)}/2.
Cf. A014092, A086473.

cp's OEIS Frontend

A086888 a(n)=sqrt(s^2 - 4*p) where s=A086533(n), p=A086860(n).

Views

Author

Keywords

Extensions

A086533 Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473.

Views

Author

Keywords

Comments

References

Links

Crossrefs