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 A286305 #19 Feb 16 2025 08:33:44
%S A286305 1,1,1,1,2,2,2,2,4,5,5,5,7,8,8,8,12,14,15,15,19,21,22,22,28,33,35,37,
%T A286305 43,48,50,52,62,70,75,79,92,100,105,109,126,140,148,157,177,194,202,
%U A286305 211,237,261,276,290,324,351,370,384,424,462,489,514,562,609,640,670,728,787,831,873,948,1016,1071,1118,1210,1296,1366,1433
%N A286305 Number of partitions of n into powerful parts (A001694).
%H A286305 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PowerfulNumber.html">Powerful Number</a>
%H A286305 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a>
%H A286305 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A286305 G.f.: Product_{k>=1} 1/(1 - x^A001694(k)).
%F A286305 a(n) = A078635(n) for n < 72.
%e A286305 a(8) = 4 because we have [8], [4, 4], [4, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1].
%t A286305 nmax = 75; CoefficientList[Series[1/(1 - x) Product[1/(1 - Boole[Min@ FactorInteger[k][[All, 2]] > 1] x^k), {k, 2, nmax}], {x, 0, nmax}], x]
%Y A286305 Cf. A001694, A078635, A286320.
%K A286305 nonn
%O A286305 0,5
%A A286305 _Ilya Gutkovskiy_, May 12 2017