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 A081779 #14 May 05 2024 23:48:05 %S A081779 30,240,390,810,1020,1920,2100,3120,3750,6090,6480,7380,7770,8160, %T A081779 10290,10530,15360,16800,20130,21870,24960,27540,30000,32760,33390, %U A081779 39930,46410,48720,48750,51840,56700,59040,60060,62160,65280,65910,82320,84240,94920,96360 %N A081779 Ordered m for which m = k^3*a*b*(a^4 - b^4) determine (unique) solution triples(k,a,b), where k=1,2,3,... and (a,b) are coprime pairs, not both odd (i.e., of opposite parity). %C A081779 Also called Saint-Exupery numbers. %H A081779 N. des Vallieres and F. D'Agay, <a href="http://www.saint-exupery.org/home/inv_math1.htm">Le Probleme du Pharaon</a>. %F A081779 a(n) = A057096(n)/2. %t A081779 Import["https://oeis.org/A057096/b057096.txt", "Table"][[;;40, 2]]/2 (* _Jean-François Alcover_, Nov 21 2019 *) %Y A081779 Cf. A057096. %K A081779 nice,nonn %O A081779 1,1 %A A081779 _Lekraj Beedassy_, Apr 10 2003 %E A081779 Corrected and extended by _Jean-François Alcover_, Nov 21 2019