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 A245530 #20 Nov 10 2024 09:24:23
%S A245530 1,36,144,4,400,576,784,14400,9,32400,4356,3600,6084,1587600,129600,
%T A245530 16,10404,11664,23104,14400,15876,17424,33856,20736,25,876096,
%U A245530 25401600,1254400,53824,44100,61504,57600,85377600,4161600,2822400,36,136900,116964,97344
%N A245530 a(n) = smallest square which is the product of a minimal set of distinct numbers not less than n.
%C A245530 a(n) mod n = 0; a(n) mod A006255(n) = 0.
%H A245530 Peter Kagey, <a href="/A245530/b245530.txt">Table of n, a(n) for n = 1..1000</a> (First 125 terms from Reinhard Zumkeller)
%F A245530 a(n) = Product_{k=1..A066400(n)} A245499(n,k), product of n-th row in A245499.
%F A245530 a(n) = A066401(n)^2.
%t A245530 Table[k = 0; While[Length@ # == 0 &@ Set[f, Select[Rest@ Subsets@ Range@ k, IntegerQ@ Sqrt[n (Times @@ # &[n + #])] &]], k++]; If[IntegerQ@ Sqrt@ n, k = {n}, k = n + Prepend[First@ f, 0]]; Times @@ k, {n, 22}] (* _Michael De Vlieger_, Oct 26 2016 *)
%o A245530 (Haskell)
%o A245530 a245530 = product . a245499_row
%Y A245530 Cf. A006255, A066400, A066401, A245499.
%K A245530 nonn
%O A245530 1,2
%A A245530 _Reinhard Zumkeller_, Jul 25 2014