cp's OEIS Frontend

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.

A294146 Sum of the larger parts of the partitions of n into two parts with smaller part squarefree.

This page as a plain text file.
%I A294146 #16 Mar 23 2023 10:10:17
%S A294146 0,1,2,5,7,12,15,18,21,29,33,43,48,60,66,72,78,84,90,106,113,131,139,
%T A294146 147,155,176,185,208,218,243,254,265,276,304,316,328,340,371,384,397,
%U A294146 410,444,458,494,509,547,563,579,595,611,627,669,686,703,720,737
%N A294146 Sum of the larger parts of the partitions of n into two parts with smaller part squarefree.
%H A294146 Harvey P. Dale, <a href="/A294146/b294146.txt">Table of n, a(n) for n = 1..1000</a>
%H A294146 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294146 a(n) = Sum_{i=1..floor(n/2)} (n - i) * mu(i)^2, where mu is the Möbius function (A008683).
%t A294146 Table[Sum[(n - i)*MoebiusMu[i]^2, {i, Floor[n/2]}], {n, 80}]
%t A294146 Table[Total[Select[IntegerPartitions[n,{2}],SquareFreeQ[#[[2]]]&][[;;,1]]],{n,70}] (* _Harvey P. Dale_, Mar 23 2023 *)
%Y A294146 Cf. A008683, A008966, A294145.
%K A294146 nonn,easy
%O A294146 1,3
%A A294146 _Wesley Ivan Hurt_, Oct 23 2017