login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A341075
Number of partitions of n into 6 distinct squarefree parts.
6
1, 0, 0, 1, 2, 2, 2, 3, 6, 5, 6, 7, 12, 12, 15, 18, 26, 26, 28, 34, 44, 46, 50, 60, 77, 79, 86, 98, 122, 126, 134, 154, 188, 196, 207, 236, 277, 292, 305, 343, 400, 423, 443, 492, 567, 596, 624, 686, 779, 819, 856, 938, 1052, 1108, 1149, 1255, 1394, 1463, 1515, 1646, 1818
OFFSET
24,5
MAPLE
b:= proc(n, i, t) option remember; `if`(n=0,
`if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
`if`(numtheory[issqrfree](i), b(n-i, min(n-i, i-1), t-1), 0)))
end:
a:= n-> b(n$2, 6):
seq(a(n), n=24..84); # Alois P. Heinz, Feb 04 2021
MATHEMATICA
Table[Length[Select[IntegerPartitions[n, {6}], Length[Union[#]]==6&&AllTrue[ #, SquareFreeQ]&]], {n, 24, 90}] (* Harvey P. Dale, Jan 16 2022 *)
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 04 2021
STATUS
approved