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 A362971 #17 May 13 2023 06:17:31
%S A362971 1,9,25,52,84,148,229,354,482,698,941,1197,1540,1972,2484,3109,3757,
%T A362971 4486,5350,6350,7374,8670,10001,11729,13673,15673,17721,19908,22105,
%U A362971 24506,27098,29842,32967,36342,39798,43686,47686,51782,56695,61695,66879,72367,78199
%N A362971 Partials sums of the cubefull numbers (A036966).
%H A362971 Amiram Eldar, <a href="/A362971/b362971.txt">Table of n, a(n) for n = 1..10000</a>
%H A362971 Rafael Jakimczuk, <a href="https://doi.org/10.12988/imf.2017.7759">The kernel of powerful numbers</a>, International Mathematical Forum, Vol. 12, No. 15 (2017), pp. 721-730, Theorem 2.7, p. 729.
%F A362971 a(n) = Sum_{k=1..n} A036966(k).
%F A362971 a(n) = c * A036966(n)^(4/3) + o(A036966(n)^(4/3)), where c = A362974 / 4 = 1.1648165306... (Jakimczuk, 2017).
%F A362971 a(n) ~ c * n^4, where c = 1/(4 * A362974 ^ 3) = 0.002471652768... .
%t A362971 Accumulate[Select[Range[10000], # == 1 || Min[FactorInteger[#][[;; , 2]]] > 2 &]]
%o A362971 (PARI) lista(kmax) = {my(s = 0); for(k = 1, kmax, if(k==1 || vecmin(factor(k)[, 2]) > 2, s += k; print1(s, ", ")));}
%Y A362971 Cf. A036966, A174172, A362974.
%K A362971 nonn
%O A362971 1,2
%A A362971 _Amiram Eldar_, May 13 2023