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 A382508 #16 Aug 02 2025 06:31:45
%S A382508 4728,2314,1165,2169,1429,703,304,1006,283,1532,129,351,135,241,595,
%T A382508 668,58,175,72,511,60,136,52,166,994,51,36,110,35,331,15,123,12,49,
%U A382508 109,69,20,39,12,301,18,36,20,37,57,31,19,74,6,315,11,29,8,10,38,24,10,25,6,95
%N A382508 a(n) is the number of solutions to the problem described in A381621 with smallest price equal to n.
%H A382508 Hugo Pfoertner, <a href="/A382508/b382508.txt">Table of n, a(n) for n = 1..125</a>
%e A382508 a(71) = 0 because no 4-tuple with smallest element = 71 exists.
%e A382508 a(91) = 1 because the only 4-tuple with smallest element 91 is [91, 100, 110, 301000].
%t A382508 (* Uses a tested heuristic upper bound for the second element b in the 4-tuple; running times > 10 minutes for small n, depending on the computer speed *)
%t A382508 a382508[n_] := Sum[Length[Solve[10^6*(n+b+c+d) == n*b*c*d && c>=b && d>=c,{c,d}, Integers]], {b, n, 111+Floor[1600/n^0.55-n/2]}];
%Y A382508 Cf. A381619, A381620, A381621.
%K A382508 nonn,fini,full
%O A382508 1,1
%A A382508 _Hugo Pfoertner_, Mar 30 2025