The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A246951 Number of endofunctions f on [n] such that the number of cycles of f is a multiple of 3 for each size that is a multiple of 3. 2

%I #6 Sep 10 2014 20:35:38

%S 1,1,4,25,224,2625,37936,651553,12963840,293219361,7429984000,

%T 208486630121,6417388432896,214990745268065,7787303908091904,

%U 303250854519320625,12633932936000045056,560712315504995304897,26410168773292930375680,1315770870814835066545081

%N Number of endofunctions f on [n] such that the number of cycles of f is a multiple of 3 for each size that is a multiple of 3.

%H Alois P. Heinz, <a href="/A246951/b246951.txt">Table of n, a(n) for n = 0..380</a>

%p with(combinat):

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

%p add(`if`(irem(j, igcd(i, 3))<>0, 0, b(n-i*j, i-1)*

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

%p end:

%p a:= n-> add(b(j$2)*n^(n-j)*binomial(n-1, j-1), j=0..n):

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

%Y Cf. A212599.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Sep 08 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 June 16 12:15 EDT 2024. Contains 373429 sequences. (Running on oeis4.)