cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A086860 Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533.

Original entry on oeis.org

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
Offset: 1

Views

Author

Lekraj Beedassy, Sep 12 2003

Keywords

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).

Crossrefs

Cf. A086533.

Extensions

Corrected by Ray Chandler, Oct 23 2003

A086888 a(n)=sqrt(s^2 - 4*p) where s=A086533(n), p=A086860(n).

Original entry on oeis.org

9, 57, 57, 95, 9, 99, 147, 177, 63, 225, 231, 243, 177, 279, 411, 441, 291, 57, 441, 411, 381, 651, 609, 441, 669, 355, 267, 531, 801, 693, 789, 417, 711, 897, 477, 155
Offset: 1

Views

Author

Lekraj Beedassy, Sep 17 2003

Keywords

Extensions

More terms from Ray Chandler, Oct 23 2003
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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