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!)
A339163 Number of compositions (ordered partitions) of n into distinct parts, the least being 2. 8

%I #6 Nov 25 2020 21:28:20

%S 0,0,1,0,0,2,2,2,2,8,8,14,14,20,44,50,74,104,128,158,326,356,524,698,

%T 986,1160,1592,2606,3158,4316,5708,7706,10082,12920,16136,25718,30614,

%U 41756,53396,71978,91058,122144,149384,193670,279614,342860,447764,581234

%N Number of compositions (ordered partitions) of n into distinct parts, the least being 2.

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

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

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

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

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

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

%p end:

%p a:= n-> `if`(n<2, 0, b(n-2$2, 1)):

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

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

%Y Cf. A002865, A032022, A096749, A339162, A339164, A339165, A339166.

%K nonn

%O 0,6

%A _Ilya Gutkovskiy_, Nov 25 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 14 16:35 EDT 2024. Contains 375165 sequences. (Running on oeis4.)