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

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,1

Comments

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.

References

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

Links

Table of n, a(n) for n=1..47.

G. Darby, Know, Don't Know Problem.

R. V. Gassel et al., To Know, or Not To Know.

K. Uhland, A Great Puzzle.

Crossrefs

For the corresponding (unique) products see A086860.

The number pairs are given by {a(n) -+ A086888(n)}/2.

Cf. A014092, A086473.

Sequence in context: A125992 A363714 A054402 * A226685 A108211 A255885

Adjacent sequences: A086530 A086531 A086532 * A086534 A086535 A086536

Keyword

nonn

Author

Lekraj Beedassy, Sep 10 2003

Status

approved