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!)
A339101 Number of compositions (ordered partitions) of n into distinct parts >= 3. 8

%I #8 Nov 24 2020 07:14:09

%S 1,0,0,1,1,1,1,3,3,5,5,7,13,15,21,29,35,43,79,87,123,161,221,259,349,

%T 531,645,857,1115,1471,1903,2403,2979,4493,5357,7135,9013,11919,14925,

%U 19685,23939,30667,42679,52215,67035,86009,109541,137923,177493,222027,277749

%N Number of compositions (ordered partitions) of n into distinct parts >= 3.

%H Alois P. Heinz, <a href="/A339101/b339101.txt">Table of n, a(n) for n = 0..5000</a>

%H <a href="/index/Com#comp">Index entries for sequences related to compositions</a>

%F G.f.: Sum_{k>=0} k! * x^(k*(k + 5)/2) / Product_{j=1..k} (1 - x^j).

%e a(7) = 3 because we have [7], [4, 3] and [3, 4].

%p b:= proc(n, i, p) option remember;

%p `if`(n=0, p!, `if`((i-2)*(i+3)/2<n, 0, add(

%p b(n-i*j, i-1, p+j), j=0..min(1, n/i))))

%p end:

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

%p seq(a(n), n=0..50); # _Alois P. Heinz_, Nov 23 2020

%t nmax = 50; CoefficientList[Series[Sum[k! x^(k (k + 5)/2)/Product[1 - x^j, {j, 1, k}], {k, 0, nmax}], {x, 0, nmax}], x]

%Y Cf. A008483, A025148, A032020, A032022, A078012, A339102, A339103, A339104.

%K nonn

%O 0,8

%A _Ilya Gutkovskiy_, Nov 23 2020

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 August 10 21:39 EDT 2024. Contains 375058 sequences. (Running on oeis4.)