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!)
A351834 Number of partitions of n into exactly two distinct parts, at least one of which is squarefree. 1
0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 7, 9, 9, 11, 9, 11, 11, 12, 10, 12, 13, 14, 12, 14, 14, 16, 12, 16, 17, 18, 15, 18, 19, 19, 16, 19, 21, 22, 18, 21, 23, 24, 18, 22, 23, 26, 21, 24, 24, 27, 22, 26, 27, 28, 24, 28, 29, 30, 24, 30, 30, 33, 24, 32, 32, 34, 27 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = Sum_{k=1..floor((n-1)/2)} (mu(k)^2 + mu(n-k)^2 - mu(k)^2*mu(n-k)^2), where mu is the Möbius function.
CROSSREFS
Cf. A005117, A008683 (mu), A351833.
Sequence in context: A167232 A319468 A137791 * A096125 A140828 A262907
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Feb 21 2022
STATUS
approved

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 June 30 13:09 EDT 2024. Contains 373870 sequences. (Running on oeis4.)