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 A287299 #9 Feb 16 2025 08:33:46
%S A287299 0,0,0,0,0,1,0,0,0,1,2,0,0,0,2,1,0,1,2,2,0,0,2,2,1,1,3,0,1,1,4,3,0,2,
%T A287299 2,2,0,3,4,3,1,2,6,3,1,0,5,4,2,2,4,3,0,2,3,5,0,1,3,4,3,2,4,3,3,4,5,4,
%U A287299 0,2,5,5,0,4,6,2,1,1,7,3,1,2,7,4,2,4,5,5,1,3,6,5,1,3,6,6,3,4,4,4,2,4,7,6,3,1,4,4,0,4,6,5,2,2,7,5,2,1,7,8,4
%N A287299 Number of ways of writing n as a sum of a proper prime power (A246547) and a nonprime squarefree number (A000469).
%C A287299 Conjecture: a(n) > 0 for all n > 108.
%H A287299 Ilya Gutkovskiy, <a href="/A287299/a287299.pdf">Extended graphical example</a>
%H A287299 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimePower.html">Prime Power</a>
%H A287299 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Squarefree.html">Squarefree</a>
%F A287299 G.f.: (Sum_{k>=1} x^A246547(k))*(Sum_{k>=1} x^A000469(k)).
%e A287299 a(26) = 3 because we have [25, 1], [22, 4] and [16, 10].
%t A287299 nmax = 120; CoefficientList[Series[(Sum[Boole[SquareFreeQ[k] && ! PrimeQ[k]] x^k, {k, 1, nmax}]) (Sum[Boole[PrimePowerQ[k] && ! PrimeQ[k]] x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
%o A287299 (PARI) x='x+O('x^120); concat([0, 0, 0, 0, 0], Vec(sum(k=1, 120, (issquarefree(k) && !isprime(k))*x^k) * sum(k=1, 120, (isprimepower(k) && !isprime(k))*x^k))) \\ _Indranil Ghosh_, May 23 2017
%Y A287299 Cf. A000469, A098983, A246547, A282192, A282290, A282318, A282947.
%K A287299 nonn
%O A287299 0,11
%A A287299 _Ilya Gutkovskiy_, May 23 2017