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!)
A341455 Number of partitions of n into 8 nonprime parts. 9

%I #11 Feb 23 2022 06:49:19

%S 1,0,0,1,0,1,1,1,2,2,2,3,3,4,6,6,7,9,10,12,15,17,20,24,28,32,38,43,51,

%T 59,67,77,90,101,119,133,152,172,199,220,256,283,325,359,412,453,520,

%U 569,652,711,810,882,1005,1091,1238,1341,1519,1641,1854,1999

%N Number of partitions of n into 8 nonprime 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`(isprime(i), 0, b(n-i, min(n-i, i), t-1))))

%p end:

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

%p seq(a(n), n=8..67); # _Alois P. Heinz_, Feb 12 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[PrimeQ[i], 0, b[n - i, Min[n - i, i], t - 1], 0]]];

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

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

%Y Cf. A002095, A005171, A018252, A062610, A259198, A341408, A341451, A341452, A341453, A341454, A341457.

%K nonn

%O 8,9

%A _Ilya Gutkovskiy_, Feb 12 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 May 2 06:11 EDT 2024. Contains 372178 sequences. (Running on oeis4.)