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 A294232 #14 Jul 16 2025 09:19:04
%S A294232 0,0,0,0,1,1,1,0,1,2,2,1,2,3,3,1,2,2,3,1,3,3,4,1,3,4,4,3,5,6,6,3,5,5,
%T A294232 6,1,5,6,6,2,5,6,5,2,5,8,8,3,6,8,9,3,7,7,10,4,7,7,9,4,8,9,9,5,9,10,10,
%U A294232 4,10,10,12,2,10,10,11,5,11,13,12,6
%N A294232 Number of partitions of n into two parts with smaller part squarefree and larger part nonsquarefree.
%H A294232 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294232 a(n) = Sum_{i=1..floor(n/2)} mu(i)^2 * (1 - mu(n-i)^2), where mu is the Möbius function (A008683).
%F A294232 a(n) = A294101(n) - A294233(n). - _Wesley Ivan Hurt_, Jul 16 2025
%t A294232 Table[Sum[(1 - MoebiusMu[n - k]^2) MoebiusMu[k]^2, {k, Floor[n/2]}], {n, 80}]
%Y A294232 Cf. A008683, A008966, A294101, A294233.
%K A294232 nonn,easy
%O A294232 1,10
%A A294232 _Wesley Ivan Hurt_, Oct 25 2017