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.

A086473 Numbers in A058080 having only one factor pair (both distinct from 1) that add up to a sum belonging to A014092.

Original entry on oeis.org

18, 24, 28, 50, 52, 54, 76, 92, 96, 98, 100, 112, 124, 140, 144, 148, 152, 160, 172, 176, 188, 192, 208, 212, 216, 220, 228, 232, 242, 244, 260, 266, 268, 280, 288, 290, 292, 304, 308, 316, 332, 336, 338, 344, 356, 374, 384, 388, 392, 400, 412, 434, 436, 448
Offset: 1

Views

Author

Lekraj Beedassy, Sep 09 2003

Keywords

Comments

Related to the "Impossible Problem" of Martin Gardner.

Examples

			A058080(3)=18 is in the sequence because 18=2*9=3*6 and only 2+9=11 belongs to A014092. However, A058080(7)=30 is not in the sequence because 30=2*15=3*10=5*6 with both 2+15 and 5+6 belonging to A014092.
		

References

  • M. Criton, "Le Problème Impossible", Jeux Mathématiques, Tangente Hors Série No. 20 Pole Paris 2004.

Crossrefs

Extensions

Corrected and extended by Ray Chandler, Sep 21 2003