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 A286320 #30 Feb 16 2025 08:33:44
%S A286320 1,1,0,0,1,1,0,0,1,2,1,0,1,2,1,0,1,2,1,0,1,2,1,0,1,3,2,1,2,3,2,1,2,3,
%T A286320 3,2,4,5,3,2,4,5,3,2,4,6,4,2,4,7,5,2,5,8,5,2,5,8,6,3,5,10,8,4,6,10,8,
%U A286320 4,6,10,9,5,8,12,10,6,9,13,10,6,9,15,12,7,10,17,14,7,11,18,15,8,11,18,16,9,11,20,18,10,13
%N A286320 Number of partitions of n into distinct powerful parts (A001694).
%H A286320 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PowerfulNumber.html">Powerful Number</a>
%H A286320 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a>
%H A286320 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A286320 G.f.: Product_{k>=1} (1 + x^A001694(k)).
%F A286320 a(n) = A284171(n) for n < 72.
%e A286320 a(25) = 3 because we have [25], [16, 9] and [16, 8, 1].
%t A286320 nmax = 100; CoefficientList[Series[(1 + x) Product[1 + Boole[Min@ FactorInteger[k][[All, 2]] > 1] x^k, {k, 2, nmax}], {x, 0, nmax}], x]
%Y A286320 Cf. A001694, A284171, A286305.
%K A286320 nonn
%O A286320 0,10
%A A286320 _Ilya Gutkovskiy_, May 12 2017