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 A330573 #16 Apr 19 2024 03:30:25
%S A330573 0,1,1,2,3,4,5,8,7,10,10,14,14,16,16,22,20,26,24,30,28,34,30,43,36,43,
%T A330573 40,51,44,56,49,63,55,66,55,78,64,75,70,89,72,93,77,98,87,103,84,122,
%U A330573 94,115,104,127,102,136,109,141,123,143,117,170,128,153,138,174,138,183,143,183,161,189,152,224,163,200,180
%N A330573 a(n) = Sum_{k = 1..ceiling(n/2)} [u_2(k)*u_2(n+1-k)], where u_2(k) is number of unordered factorization k = i*j (A038548).
%C A330573 An analog of A055507 for unordered factorizations.
%C A330573 For background references see A330570.
%H A330573 Amiram Eldar, <a href="/A330573/b330573.txt">Table of n, a(n) for n = 0..10000</a>
%t A330573 s[n_] := s[n] = Ceiling[DivisorSigma[0, n]/2]; a[n_] := Sum[s[k]*s[n + 1 - k], {k, 1, Ceiling[n/2]}]; Array[a, 100, 0] (* _Amiram Eldar_, Apr 19 2024*)
%Y A330573 Cf. A000005, A038548, A055507.
%Y A330573 See A330572 for another version.
%K A330573 nonn
%O A330573 0,4
%A A330573 _N. J. A. Sloane_, Jan 08 2020
%E A330573 Offset and name corrected by _Amiram Eldar_, Apr 19 2024