The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086860 Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533. 2
 52, 244, 1168, 1776, 4672, 4192, 2608, 724, 8128, 916, 1912, 3328, 15424, 9952, 3352, 3592, 53632, 80128, 36352, 51712, 65152, 5272, 20512, 72832, 22432, 111756, 133888, 84352, 6472, 48448, 26272, 172288, 107392, 37480, 187648, 242496 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Related to Martin Gardner's "Impossible Problem". 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). LINKS Table of n, a(n) for n=1..36. CROSSREFS Cf. A086533. Sequence in context: A251287 A023417 A122239 * A070147 A236517 A320556 Adjacent sequences: A086857 A086858 A086859 * A086861 A086862 A086863 KEYWORD nonn AUTHOR Lekraj Beedassy, Sep 12 2003 EXTENSIONS Corrected by Ray Chandler, Oct 23 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 11:44 EST 2023. Contains 367724 sequences. (Running on oeis4.)