cp's OEIS Frontend

A093345 a(n) = n! * {1 + Sum[i=1..n, 1/i*Sum(j=0..i-1, 1/j!)]}.

%I A093345 #16 Oct 05 2018 10:45:52
%S A093345 1,2,6,23,108,605,3956,29649,250892,2367629,24662700,281153801,
%T A093345 3482350724,46572620757,668943488084,10271127486065,167892667249116,
%U A093345 2911049382788189,53365747562592092,1031352659792534169
%N A093345 a(n) = n! * {1 + Sum[i=1..n, 1/i*Sum(j=0..i-1, 1/j!)]}.
%C A093345 Number of {12,2*1}-avoiding signed permutations in the hyperoctahedral group B_n.
%H A093345 D. Daly and L. Pudwell, <a href="http://faculty.valpo.edu/lpudwell/slides/sandiego2013.pdf">Pattern avoidance in rook monoids</a>, 2013. - From _N. J. A. Sloane_, Feb 03 2013
%H A093345 T. Mansour and J. West, <a href="https://arxiv.org/abs/math/0207204">Avoiding 2-letter signed patterns</a>, arXiv:math/0207204 [math.CO], 2002.
%F A093345 E.g.f.: (exp(1)*(Ei(1, 1-x)-Ei(1, 1))+1)/(1-x). a(n) = n!*(1+Sum(A000522(i-1)/i!, i =1..n)). - _Vladeta Jovovic_, Apr 27 2004
%F A093345 Conjecture: a(n) -2*n*a(n-1) +(n^2-2)*a(n-2) -(n-2)^2*a(n-3)=0. - _R. J. Mathar_, May 30 2014
%t A093345 a[n_] := n! (1+Sum[1/i Sum[1/j!, {j, 0, i-1}], {i, 1, n}])
%t A093345 Table[a[n], {n, 0, 19}] (* _Jean-François Alcover_, Oct 05 2018 *)
%o A093345 (PARI) a(n)=n!+n!*sum(i=1,n,1/i*sum(j=0,i-1,1/j!))
%Y A093345 Cf. A000774.
%Y A093345 Cf. A000522, A093344.
%Y A093345 Contribution from _Johannes W. Meijer_, Oct 16 2009: (Start)
%Y A093345 Equals row sums of A165675.
%Y A093345 (End)
%K A093345 nonn
%O A093345 0,2
%A A093345 _Ralf Stephan_, Apr 26 2004