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 A086860 #9 May 26 2017 15:42:19 %S A086860 52,244,1168,1776,4672,4192,2608,724,8128,916,1912,3328,15424,9952, %T A086860 3352,3592,53632,80128,36352,51712,65152,5272,20512,72832,22432, %U A086860 111756,133888,84352,6472,48448,26272,172288,107392,37480,187648,242496 %N A086860 Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533. %C A086860 Related to Martin Gardner's "Impossible Problem". %C A086860 a(n) is thus a subsequence of A086473, itself a subsequence of A058080. Consider the mapping f:P->S defined thus: S is the sum of a factor pair (both different from 1) of P, where P is a(n). If S is A086533(n) (a subsequence of A014092), then both f and its inverse are injective (but not onto). %Y A086860 Cf. A086533. %K A086860 nonn %O A086860 1,1 %A A086860 _Lekraj Beedassy_, Sep 12 2003 %E A086860 Corrected by _Ray Chandler_, Oct 23 2003