cp's OEIS Frontend

A108704 Number of partitions of 112233...nn into n pairs.

%I A108704 #31 May 29 2022 07:13:54
%S A108704 1,1,4,18,126,1110,12120,156660,2341500,39701340,752839920,
%T A108704 15785181720,362606123880,9055825538760,244296192460320,
%U A108704 7079382509799600,219321853964413200,7233629128601475600,253054306933115688000,9358989706213886138400,364860828050107348159200
%N A108704 Number of partitions of 112233...nn into n pairs.
%D A108704 Laszlo Lovasz, Combinatorial Problems and Solutions, AMS Chelsea Publishing, American Mathematical Society.
%H A108704 G. C. Greubel, <a href="/A108704/b108704.txt">Table of n, a(n) for n = 0..400</a>
%F A108704 E.g.f.: exp(x*x/2)/sqrt(1-2*x).
%F A108704 a(n) ~ 2^(n+1/2)*n^n/exp(n-1/8). - _Vaclav Kotesovec_, Sep 26 2013
%F A108704 a(n) = 2^n*(n-1/2)!*2F2((1-n)/2,-n/2;1/4 -n/2,3/4 - n/2; 1/8)/sqrt(Pi). - _Benedict W. J. Irwin_, May 25 2016
%F A108704 Conjecture: a(n)-(2*n-1)*a(n-1)-(n-1)*a(n-2)+2*(n-1)*(n-2)*a(n-3)=0. - _R. J. Mathar_, Jun 08 2016
%F A108704 From _Emanuele Munarini_, May 25 2022: (Start)
%F A108704 The exponential generating series A(t) satisfies the differential equation (1-2*t)*A'(t) = (1+t-2*t^2)*A(t), which is equivalent to the conjectured recurrence.
%F A108704 a(n) = Sum_{k=0..n/2} binomial(n,k)*binomial(2*n-4*k,n-2*k)*(n-k)!/2^(n-k).
%F A108704 (End)
%e A108704 Partitions of 1122 into 2 pairs: 11 22, 12 12, 12 21, 21 21 = 4 partitions so a(2)=4.
%p A108704 a:= n-> n! *coeff(series(exp(x*x/2)/sqrt(1-2*x), x, n+1), x, n):
%p A108704 seq (a(n), n=0..20);
%t A108704 CoefficientList[Series[E^(x*x/2)/Sqrt[1-2*x], {x, 0, 20}], x]* Range[0, 20]! (* _Vaclav Kotesovec_, Sep 26 2013 *)
%o A108704 (PARI) my(x='x+O('x^50)); Vec(serlaplace(exp(x*x/2)/sqrt(1-2*x))) \\ _G. C. Greubel_, May 24 2017
%Y A108704 Cf. A002135.
%K A108704 nonn
%O A108704 0,3
%A A108704 _Miklos Kristof_, Jun 20 2005