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 A380750 #18 Mar 09 2025 14:37:16
%S A380750 1019,1559,1637,1103,743,419,1039,359,311,479,653,509,389,251,593,521,
%T A380750 263,197,1061,131,353,269,239,167,89,179,337,113,139,83,181,229,934,
%U A380750 898,277,151,103,554,1042,281,109,107,566,283,1299,79,386,157,1959,173,241
%N A380750 a(n) is the smallest integer k such that k*x*y*z*w = (x + k) * (y + k) * (z + k) * (w + k), 0 < x <= y <= z <= w has exactly n integer solutions.
%C A380750 a(1)-a(32) are all primes.
%H A380750 Zhining Yang, <a href="/A380750/b380750.txt">Table of n, a(n) for n = 1..171</a>
%e A380750 For n=8, a(n)=359 because 359 is the smallest integer such that 359*x*y*z*w = (x+359)*(y+359)*(z+359)*(w+359), 0 < x <= y <= z <= w has exactly 8 positive integer solutions: {{2, 406, 6462, 209302385}, {3, 185, 30515, 357644416}, {4, 168, 1375, 1804333641}, {6, 74, 42001, 462553550}, {6, 97, 1406, 462553550}, {15, 28, 8600, 1804333641}, {15, 100, 168, 1804333641}, {22, 50, 234, 11057989441}}.
%Y A380750 Cf. A374059, A375787, A380749.
%K A380750 nonn
%O A380750 1,1
%A A380750 _Zhining Yang_, Jan 31 2025