The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285861 Number of permutations of [n] with ten ordered cycles such that equal-sized cycles are ordered with increasing least elements. 3

%I #13 May 30 2018 08:06:05

%S 1,550,71225,5448300,355885530,17364367020,748875613200,

%T 31800834780000,1237174959934485,46053097166277630,

%U 1673378033771898675,61000413008705597700,2201843172941618228220,79401490178154061870920,2850407051830237872094980

%N Number of permutations of [n] with ten ordered cycles such that equal-sized cycles are ordered with increasing least elements.

%H Alois P. Heinz, <a href="/A285861/b285861.txt">Table of n, a(n) for n = 10..450</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>

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

%p [multinomial](n, n-i*j, i\$j)/j!^2*x^j, j=0..n/i)), x, 11)

%p end:

%p a:= n-> coeff(b(n\$2, 0), x, 10):

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

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

%t b[n_, i_, p_] := b[n, i, p] = Series[If[n == 0 || i == 1, (p + n)!/n!*x^n, Sum[b[n - i*j, i - 1, p + j]*(i - 1)!^j*multinomial[n, Join[{n - i*j}, Table[i, j]]]/j!^2*x^j, {j, 0, n/i}]], {x, 0, 11}];

%t a[n_] := Coefficient[b[n, n, 0], x, 10];

%t Table[a[n], {n, 10, 25}] (* _Jean-François Alcover_, May 30 2018, from Maple *)

%Y Column k=10 of A285849.

%Y Cf. A285925.

%K nonn

%O 10,2

%A _Alois P. Heinz_, Apr 27 2017

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.

Last modified September 29 23:48 EDT 2023. Contains 365781 sequences. (Running on oeis4.)