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!)
A341098 Number of partitions of n into 10 distinct squarefree parts. 6

%I #8 Feb 24 2022 07:16:58

%S 1,1,1,1,2,3,2,4,6,8,7,10,14,17,17,22,32,35,37,47,62,71,72,91,114,132,

%T 136,167,205,234,247,293,355,398,426,497,590,661,708,819,956,1066,

%U 1141,1306,1501,1672,1791,2030,2318,2559,2747,3081,3490,3835,4115

%N Number of partitions of n into 10 distinct squarefree parts.

%p b:= proc(n, i, t) option remember; `if`(n=0,

%p `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+

%p `if`(numtheory[issqrfree](i), b(n-i, min(n-i, i-1), t-1), 0)))

%p end:

%p a:= n-> b(n$2, 10):

%p seq(a(n), n=72..126); # _Alois P. Heinz_, Feb 04 2021

%t b[n_, i_, t_] := b[n, i, t] = If[n == 0,

%t If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +

%t If[SquareFreeQ[i], b[n - i, Min[n - i, i - 1], t - 1], 0]]];

%t a[n_] := b[n, n, 10];

%t Table[a[n], {n, 72, 126}] (* _Jean-François Alcover_, Feb 24 2022, after _Alois P. Heinz_ *)

%Y Cf. A005117, A008966, A098236, A307835, A326626, A341070, A341073, A341074, A341075, A341095, A341096, A341097.

%K nonn

%O 72,5

%A _Ilya Gutkovskiy_, Feb 04 2021

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)