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!)
A246191 Number of endofunctions on [n] where the smallest cycle length equals 4. 2

%I #9 Dec 28 2020 09:52:50

%S 6,120,2160,41160,861420,19949328,510320160,14348862000,440879024520,

%T 14716697990280,530761366078944,20577610843203960,853717568817968400,

%U 37746072677473752480,1771994498414094109440,88032162789004128733152,4614300279345812506938720

%N Number of endofunctions on [n] where the smallest cycle length equals 4.

%H Alois P. Heinz, <a href="/A246191/b246191.txt">Table of n, a(n) for n = 4..200</a>

%F a(n) ~ (exp(-11/6) - exp(-25/12)) * n^n. - _Vaclav Kotesovec_, Aug 21 2014

%p with(combinat):

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

%p add((i-1)!^j*multinomial(n, n-i*j, i$j)/j!*

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

%p end:

%p A:= (n, k)-> add(binomial(n-1, j-1)*n^(n-j)*b(j, k), j=0..n):

%p a:= n-> A(n, 4) -A(n, 5):

%p seq(a(n), n=4..25);

%t multinomial[n_, k_List] := n!/Times @@ (k!);

%t b[n_, i_] := b[n, i] = If[n==0, 1, If[i>n, 0, Sum[(i - 1)!^j multinomial[n, Join[{n - i*j}, Table[i, {j}]]]/j! b[n - i*j, i + 1], {j, 0, n/i}]]];

%t A[n_, k_] := Sum[Binomial[n - 1, j - 1] n^(n - j) b[j, k], {j, 0, n}];

%t a[n_] := A[n, 4] - A[n, 5];

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

%Y Column k=4 of A246049.

%K nonn

%O 4,1

%A _Alois P. Heinz_, Aug 18 2014

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