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.

A294063 Sum of the differences of the larger and smaller parts in the partitions of 2n into two parts with the larger part squarefree.

This page as a plain text file.
%I A294063 #20 Jan 19 2021 15:54:10
%S A294063 0,2,4,12,6,20,26,46,52,58,66,96,80,90,104,148,162,210,224,276,290,
%T A294063 346,318,382,352,372,394,416,438,518,542,566,592,684,712,810,838,866,
%U A294063 898,1008,960,1076,1112,1234,1270,1306,1344,1476,1514,1454,1494,1636,1676
%N A294063 Sum of the differences of the larger and smaller parts in the partitions of 2n into two parts with the larger part squarefree.
%H A294063 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294063 a(n) = 2 * Sum_{i=1..n} (n - i) * mu(2*n - i)^2, where mu is the Möbius function (A008683).
%t A294063 Table[2*Sum[(n - i) MoebiusMu[2 n - i]^2, {i, n}], {n, 80}]
%t A294063 Table[Total[#[[1]]-#[[2]]&/@Select[IntegerPartitions[2n,{2}],SquareFreeQ[ #[[1]]]&]],{n,60}] (* _Harvey P. Dale_, Jan 19 2021 *)
%o A294063 (PARI) a(n) = 2*sum(i=1, n, (n-i)*moebius(2*n-i)^2); \\ _Michel Marcus_, Nov 08 2017
%Y A294063 Cf. A008683, A008966, A294062.
%K A294063 nonn,easy
%O A294063 1,2
%A A294063 _Wesley Ivan Hurt_, Oct 22 2017