|
%I #16 Nov 24 2020 16:39:44
%S 1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,8,8,10,11,13,
%T 14,17,18,21,23,26,29,33,36,41,46,51,57,64,71,79,88,97,109,120,133,
%U 147,164,180,200,220,244,268,297,325,360,395,435,477,526,575,633,693,761,832,913
%N Number of partitions of n into distinct parts >= 8.
%H Alois P. Heinz, <a href="/A025153/b025153.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A026828(n+7). - _R. J. Mathar_, Jul 31 2008
%F G.f.: Product_{j>=8} (1+x^j). - _R. J. Mathar_, Jul 31 2008
%F G.f.: Sum_{k>=0} x^(k*(k + 15)/2) / Product_{j=1..k} (1 - x^j). - _Ilya Gutkovskiy_, Nov 24 2020
%p b:= proc(n, i) option remember;
%p `if`(n=0, 1, `if`((i-7)*(i+8)/2<n, 0,
%p add(b(n-i*j, i-1), j=0..min(1, n/i))))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..100); # _Alois P. Heinz_, Feb 07 2014
%t d[n_] := Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 && Min[#] >= 8 &]; Table[d[n], {n, 20}] (* strict partitions, parts >= 8 *)
%t Table[Length[d[n]], {n, 40}] (* A025153 for n >= 1 *)
%t (* _Clark Kimberling_, Mar 07 2014 *)
%Y Cf. A025147.
%K nonn
%O 0,18
%A _Clark Kimberling_
|
