|
%I #34 May 17 2023 17:09:34
%S 1,1,3,8,28,107,459,2151,10931,59700,348146,2155925,14112377,97266301,
%T 703484851,5323515156,42040470092,345670438963,2953171501547,
%U 26166317121747,240047041176843,2276607815242880,22290187889601330,225018607554567149,2339331996135377345
%N Number of set partitions of {1,2,...,n} such that the element 1 is in an odd-sized block.
%H Alois P. Heinz, <a href="/A224271/b224271.txt">Table of n, a(n) for n = 1..576</a>
%F E.g.f. A(x) satisfies: A'(x) = B'(x)*C(x) where B(x) is the e.g.f. for A003724 and C(x) is the e.g.f. for A005046.
%F a(n) = Sum_{k=0..floor((n-1)/2)} (k+1)*A124322(n-1,k). - _Alois P. Heinz_, Apr 02 2013
%F a(n) = Sum_{k=0..floor((n-1)/2)} binomial(n-1,2*k) * Bell(n-2*k-1). - _Ilya Gutkovskiy_, Apr 10 2022
%F From _Alois P. Heinz_, May 17 2023: (Start)
%F a(n) = Sum_{k=0..n-1} (-1)^k * A283424(n-1,k).
%F a(n) mod 2 = A131719(n+1). (End)
%e a(4) = 8 because we have: {{1},{2,3,4}}, {{1,3,4},{2}}, {{1,2,3},{4}}, {{1,2,4},{3}}, {{1},{2},{3,4}}, {{1},{2,3},{4}}, {{1},{2,4},{3}}, {{1},{2},{3},{4}}.
%p with(combinat):
%p b:= proc(n, i) option remember; expand(`if`(n=0, 1,
%p `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)/j!*
%p b(n-i*j, i-1)*`if`(irem(i, 2)=0, x^j, 1), j=0..n/i))))
%p end:
%p a:= n-> (p-> add(coeff(p, x, i)*(i+1), i=0..degree(p)))(b(n-1$2)):
%p seq(a(n), n=1..15); # _Alois P. Heinz_, Mar 08 2015
%p # second Maple program:
%p b:= proc(n, t, m) option remember; `if`(n=0, t, (m-1)*
%p b(n-1, t, m)+b(n-1, 1-t, m)+b(n-1, t, m+1))
%p end:
%p a:= n-> b(n-1, 1$2):
%p seq(a(n), n=1..25); # _Alois P. Heinz_, May 17 2023
%t nn=25;Drop[Range[0,nn]!CoefficientList[Series[Integrate[Exp[Cosh[x]-1]D[ Exp[Sinh[x]],x],x],{x,0,nn}],x],1]
%Y Cf. A000110, A003724, A005046, A102286, A124322, A131719, A283424.
%K nonn
%O 1,3
%A _Geoffrey Critzer_, Apr 02 2013
|
