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!)
A212599 Number of functions on n labeled points to themselves (endofunctions) such that the number of cycles of f that have each even size is even. 3

%I #28 Mar 18 2018 17:37:18

%S 1,1,3,18,160,1875,27126,466186,9275064,209654325,5307031000,

%T 148720701426,4570816040352,152874605142727,5527634477245440,

%U 214862754390554250,8934811701563214976,395788795274021394729,18606559519007667893376,925222631836457779380370,48518852386696450625510400

%N Number of functions on n labeled points to themselves (endofunctions) such that the number of cycles of f that have each even size is even.

%H Alois P. Heinz, <a href="/A212599/b212599.txt">Table of n, a(n) for n = 0..200</a>

%F E.g.f.: ((1+T(x))/(1-T(x)))^(1/2) * Product_{i>=1} cosh(T(x)^(2*i)/(2*i)) where T(x) is the e.g.f. for A000169.

%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, 2))<>0, 0, (i-1)!^j*

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

%p end:

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

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Sep 08 2014

%t nn=20;t=Sum[n^(n-1)x^n/n!,{n,1,nn}];p=Product[Cosh[t^(2i)/(2i)],{i,1,nn}];Range[0,nn]! CoefficientList[Series[((1+t)/(1-t))^(1/2) p,{x,0,nn}],x]

%Y Cf. A003483, A246951, A116956.

%K nonn,nice

%O 0,3

%A _Geoffrey Critzer_, May 22 2012

%E Maple program fixed by _Vaclav Kotesovec_, Sep 13 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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)