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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294235 Number of partitions of n into two parts such that the larger part is nonsquarefree. 2

%I #14 Jun 19 2019 21:15:11

%S 0,0,0,0,1,1,1,1,1,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,5,5,6,7,7,7,7,7,7,

%T 7,7,7,7,7,7,7,7,7,7,8,9,9,9,9,10,10,10,11,11,11,11,11,11,11,11,12,12,

%U 12,13,13,13,13,13,14,14,14,14,14,14,14,15,16

%N Number of partitions of n into two parts such that the larger part is nonsquarefree.

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

%F a(n) = Sum_{i=1..floor(n/2)} (1 - mu(n-i)^2), where mu is the Möbius function (A008683).

%t Table[Sum[(1 - MoebiusMu[n - k]^2), {k, Floor[n/2]}], {n, 80}]

%Y Cf. A008683, A008966, A294234.

%K nonn,easy

%O 1,10

%A _Wesley Ivan Hurt_, Oct 25 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)