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 A085252 #14 Feb 16 2025 08:32:50
%S A085252 0,1,0,0,1,0,0,1,1,1,0,1,1,0,0,1,2,1,0,1,0,0,0,1,1,1,0,1,1,0,1,1,2,1,
%T A085252 1,2,1,0,0,2,2,0,1,1,1,0,0,1,0,2,0,2,1,1,0,0,2,1,1,0,1,0,1,1,2,0,0,2,
%U A085252 0,0,0,2,2,1,0,2,0,0,0,2,2,1,0,0,2,0,0,1,2,1,1,0,0,0,0,1,2,1,1,1,1,0
%N A085252 Number of ways to write n as sum of two powerful numbers (A001694).
%H A085252 Amiram Eldar, <a href="/A085252/b085252.txt">Table of n, a(n) for n = 1..10000</a>
%H A085252 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PowerfulNumber.html">Powerful Number</a>.
%F A085252 a(A085253(n)) = 0.
%F A085252 a(A076871(n)) > 0.
%F A085252 a(A085254(n)) = 1.
%F A085252 a(A085255(n)) > 1.
%e A085252 a(81) = 2: 81 = 9 + 72 = A001694(4) + A001694(12) = 32 + 49 = A001694(8) + A001694(10).
%t A085252 With[{m = 120}, pow = Select[Range[m], # == 1 || Min[FactorInteger[#][[;; , 2]]] > 1 &]; BinCounts[Select[Plus @@@ Union[Sort /@ Tuples[pow, {2}]], # <= m &], {1, m, 1}]] (* _Amiram Eldar_, Jan 30 2023 *)
%Y A085252 Cf. A001694, A076871, A085253, A085254, A085255.
%K A085252 nonn
%O A085252 1,17
%A A085252 _Reinhard Zumkeller_, Jun 23 2003