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.
%I A086533 #16 Jun 16 2023 18:45:06
%S A086533 17,65,89,127,137,163,179,185,191,233,247,269,305,343,427,457,547,569,
%T A086533 583,613,637,667,673,697,733,757,779,787,817,821,853,929,967,977,989,
%U A086533 997,1045,1087,1117,1207,1267,1273,1289,1297,1327,1345,1357
%N A086533 Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473.
%C A086533 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.
%D A086533 M. Gardner,"Mathematical Games" Problem 1 pp. 20, 23-24 in Scientific American, Dec. 1979.
%H A086533 G. Darby, <a href="http://www.delphiforfun.org/Programs/know_dont_know.htm">Know, Don't Know Problem</a>.
%H A086533 R. V. Gassel et al., <a href="http://puzzle.dse.nl/logical/index_us.html#know_or_not">To Know, or Not To Know</a>.
%H A086533 K. Uhland, <a href="https://web.archive.org/web/20041115232552/http://uhlandkf.homestead.com:80/files/PuzzlePage/199812Pzl.htm">A Great Puzzle</a>.
%Y A086533 For the corresponding (unique) products see A086860.
%Y A086533 The number pairs are given by {a(n) -+ A086888(n)}/2.
%Y A086533 Cf. A014092, A086473.
%K A086533 nonn
%O A086533 1,1
%A A086533 _Lekraj Beedassy_, Sep 10 2003