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!)
A335942 Number of compositions of n such that the set s of parts and multiplicities satisfies s = {1..max(s)}. 4

%I #18 May 30 2022 08:12:36

%S 1,1,2,2,3,12,12,32,51,144,191,486,679,1487,3149,5909,11637,18630,

%T 36928,76431,141009,264784,535057,921105,1774022,3388054,6303519,

%U 12255373,22527578,43358822,77695383,145170435,264722429,527776034,936538336,1807344134

%N Number of compositions of n such that the set s of parts and multiplicities satisfies s = {1..max(s)}.

%H Chai Wah Wu, <a href="/A335942/b335942.txt">Table of n, a(n) for n = 0..142</a> (n = 0..100 from Alois P. Heinz)

%e a(4) = 3: 211, 121, 112.

%e a(5) = 12: 23, 32, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111.

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

%p `if`(n=0, `if`(s={$0..max(s)}, p!, 0), `if`(i<1, 0, add(

%p b(n-i*j, i-1, {s[], j, `if`(j=0, 0, i)}, p+j)/j!, j=0..n/i)))

%p end:

%p a:= n-> b(n, floor((sqrt(1+8*(n+1))-1)/2), {0}, 0):

%p seq(a(n), n=0..35);

%t b[n_, i_, s_, p_] := b[n, i, s, p] =

%t If[n == 0, If[s == Range[0, Max[s]], p!, 0], If[i < 1, 0, Sum[

%t b[n - i*j, i - 1, Union@Flatten@{s, j, If[j == 0, 0, i]}, p + j]/j!,

%t {j, 0, n/i}]]];

%t a[n_] := b[n, Floor[(Sqrt[1 + 8*(n + 1)] - 1)/2], {0}, 0];

%t Table[a[n], {n, 0, 35}] (* _Jean-François Alcover_, May 30 2022, after _Alois P. Heinz_ *)

%Y Cf. A107429, A329741, A335941.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jun 30 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 April 24 05:40 EDT 2024. Contains 371918 sequences. (Running on oeis4.)