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 A330571 #10 Apr 19 2024 03:29:47 %S A330571 1,1,1,4,1,4,1,4,4,4,1,9,1,4,4,9,1,9,1,9,4,4,1,16,4,4,4,9,1,16,1,9,4, %T A330571 4,4,25,1,4,4,16,1,16,1,9,9,4,1,25,4,9,4,9,1,16,4,16,4,4,1,36,1,4,9, %U A330571 16,4,16,1,9,4,16,1,36,1,4,9,9,4,16,1,25,9,4,1,36,4,4,4,16,1,36,4,9,4,4,4,36 %N A330571 Square of number of unordered factorizations of n as n = i*j. %C A330571 Unordered analog of A035116. %C A330571 For background references see A330570. %H A330571 Amiram Eldar, <a href="/A330571/b330571.txt">Table of n, a(n) for n = 1..10000</a> %t A330571 a[n_] := Ceiling[DivisorSigma[0, n] / 2]^2; Array[a, 100] (* _Amiram Eldar_, Apr 19 2024 *) %o A330571 (PARI) a(n) = (numdiv(n) \/ 2)^2; \\ _Amiram Eldar_, Apr 19 2024 %Y A330571 Equals A038548(n)^2. %Y A330571 Cf. A035116. %K A330571 nonn %O A330571 1,4 %A A330571 _N. J. A. Sloane_, Jan 08 2020