login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086533 Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The first entry 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-4 in Scientific American Dec. 1979.

LINKS

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

G. Darby, The 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.

Sequence in context: A145850 A125992 A054402 * A108211 A130885 A036545

Adjacent sequences:  A086530 A086531 A086532 * A086534 A086535 A086536

KEYWORD

nonn

AUTHOR

Lekraj Beedassy, Sep 10 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 16:56 EDT 2013. Contains 225610 sequences.