login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #10 Feb 05 2018 02:59:09

%S 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 15,22,14,23,14,27,17,33,18,30,16,30,16,33,17,35,23,34,22,36,22,39,24,

%U 40,25,49,24,44,25,46,25,47,25,50,32,46,31,48,30,49,30

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

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = Sum_{k=1..n} [A008966(i) = A008966(2n-i)], where [] is the Iverson bracket.

%t Table[Sum[KroneckerDelta[MoebiusMu[k]^2, MoebiusMu[2 n - k]^2], {k, n}], {n, 80}]

%Y Cf. A008966, A294098.

%K nonn,easy

%O 1,2

%A _Wesley Ivan Hurt_, Oct 22 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 12:17 EDT 2024. Contains 376196 sequences. (Running on oeis4.)