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!)
A327828 Sum of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating 2. 2

%I #10 Dec 18 2020 04:01:56

%S 0,0,1,3,18,100,705,5166,44856,413316,4297635,47906650,586050828,

%T 7669704978,108433645502,1632017808435,26240224612920,446861879976600,

%U 8063224431751719,153335328111105282,3070484092409318100,64508501542986638550,1420061287311444508962

%N Sum of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating 2.

%H Alois P. Heinz, <a href="/A327828/b327828.txt">Table of n, a(n) for n = 0..450</a>

%F a(n) ~ c * n!, where c = A247551/2 = 1.26473873603957632409005807712697712... - _Vaclav Kotesovec_, Sep 28 2019

%p b:= proc(n, i, k) option remember; `if`(n=0, 1,

%p `if`(i>n, 0, b(n, i+1, `if`(i=k, 0, k))+

%p `if`(i=k, 0, b(n-i, i, k)*binomial(n, i))))

%p end:

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

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

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i > n, 0, b[n, i + 1, If[i == k, 0, k]] + If[i == k, 0, b[n - i, i, k] Binomial[n, i]]]];

%t a[n_] := b[n, 1, 0] - b[n, 1, 2];

%t a /@ Range[0, 23] (* _Jean-François Alcover_, Dec 18 2020, after _Alois P. Heinz_ *)

%Y Column k=2 of A327801.

%K nonn

%O 0,4

%A _Alois P. Heinz_, Sep 26 2019

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 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)