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.

A294097 Number of partitions of 2n into two parts such that both parts are either squarefree or nonsquarefree.

This page as a plain text file.
%I A294097 #10 Feb 05 2018 02:59:09
%S A294097 1,2,2,4,2,5,3,7,5,8,6,10,6,10,6,12,9,17,8,16,9,18,9,19,10,21,14,20,
%T A294097 15,22,14,23,14,27,17,33,18,30,16,30,16,33,17,35,23,34,22,36,22,39,24,
%U A294097 40,25,49,24,44,25,46,25,47,25,50,32,46,31,48,30,49,30
%N A294097 Number of partitions of 2n into two parts such that both parts are either squarefree or nonsquarefree.
%H A294097 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294097 a(n) = Sum_{k=1..n} [A008966(i) = A008966(2n-i)], where [] is the Iverson bracket.
%t A294097 Table[Sum[KroneckerDelta[MoebiusMu[k]^2, MoebiusMu[2 n - k]^2], {k, n}], {n, 80}]
%Y A294097 Cf. A008966, A294098.
%K A294097 nonn,easy
%O A294097 1,2
%A A294097 _Wesley Ivan Hurt_, Oct 22 2017