The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A307835 Number of partitions of n into 3 distinct squarefree parts. 8
0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 3, 2, 2, 3, 5, 4, 4, 5, 9, 8, 8, 9, 12, 11, 11, 12, 16, 15, 15, 17, 21, 19, 18, 20, 25, 24, 22, 28, 33, 32, 28, 33, 40, 37, 35, 40, 50, 47, 42, 48, 58, 56, 48, 56, 65, 66, 57, 63, 73, 73, 65, 70, 82, 80, 74, 81, 92, 90, 80, 92, 102, 102, 88, 104, 116, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
LINKS
FORMULA
a(n) = [x^n y^3] Product_{k>=1} (1 + mu(k)^2*y*x^k).
EXAMPLE
a(15) = 4 because we have [11, 3, 1], [10, 3, 2], [7, 6, 2] and [7, 5, 3].
MATHEMATICA
Table[Count[IntegerPartitions[n, {3}], _?(And[UnsameQ @@ #, AllTrue[#, SquareFreeQ[#] &]] &)], {n, 0, 75}]
CROSSREFS
Sequence in context: A049879 A053812 A177865 * A341651 A017828 A140087
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, May 01 2019
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 May 16 20:35 EDT 2024. Contains 372555 sequences. (Running on oeis4.)