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 A097800 #7 Feb 16 2025 08:32:54
%S A097800 1,1,1,2,2,4,2,4,7,8,5,14,14,5,23,26,18,38,17,46,65,34,75,50,106,59,
%T A097800 125,175,203,275,326,243,434,519,675,477,806,1044,1244,985,1604,1902,
%U A097800 2420,1892,2887,2391,3632,2932,4342,5424,4509,6460,5513,8021,9557,11817
%N A097800 Number of partitions of the n-th abundant number into abundant numbers.
%H A097800 Amiram Eldar, <a href="/A097800/b097800.txt">Table of n, a(n) for n = 1..10000</a>
%H A097800 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AbundantNumber.html">Abundant Number</a>
%H A097800 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Partition.html">Partition</a>
%e A097800 a(8)=4: A005101(8)=42 = A005101(5)+A005101(1)=30+12 =
%e A097800 A005101(4)+A005101(2)=24+18 = A005101(2)+2*A005101(1)=18+12+12.
%t A097800 n = 245; d = Select[Range[n], DivisorSigma[1, #] > 2 # &]; CoefficientList[ Series[1/Product[1 - x^d[[i]], {i, 1, Length[d]}], {x, 0, n}], x][[d + 1]] (* _Amiram Eldar_, Aug 02 2019 *)
%Y A097800 Cf. A005101, A000041, A097798, A097799.
%K A097800 nonn
%O A097800 1,4
%A A097800 _Reinhard Zumkeller_, Aug 25 2004