|
%I #17 Sep 11 2019 06:25:56
%S 1,1,3,11,17,53,161,285,569,1459,4699,7177,15631,28229,66883,211311,
%T 319929,627705,1163049,2150209,4422225,14320583,20392019,39962165,
%U 68618087,126643545,212615483,433704811,1312156393,1864959757,3502343041,5919183485,10364053441
%N "AFK" (ordered, size, unlabeled) transform of 1,3,5,7,...
%C Number of compositions of n into distinct parts if there are (2i-1) kinds of part i. a(3) = 11: 3, 3', 3'', 3''', 3'''', 21, 2'1, 2''1, 12, 12', 12''. - _Alois P. Heinz_, Sep 05 2015
%H Alois P. Heinz, <a href="/A032008/b032008.txt">Table of n, a(n) for n = 0..4000</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%p b:= proc(n, i, p) option remember;
%p `if`(n=0, p!, `if`(i<1, 0, b(n, i-1, p)+
%p `if`(i>n, 0, (2*i-1)*b(n-i, i-1, p+1))))
%p end:
%p a:= n-> b(n$2, 0):
%p seq(a(n), n=0..40); # _Alois P. Heinz_, Sep 05 2015
%t b[n_, i_, p_] := b[n, i, p] = If[n == 0, p!, If[i < 1, 0, b[n, i - 1, p] + If[i > n, 0, (2 i - 1)*b[n - i, i - 1, p + 1]]]];
%t a[n_] := b[n, n, 0];
%t a /@ Range[0, 40] (* _Jean-François Alcover_, Sep 11 2019, after _Alois P. Heinz_ *)
%o (PARI) seq(n)={apply(p->subst(serlaplace(p), y, 1), Vec(prod(k=1, n, 1 + (2*k-1)*x^k*y + O(x*x^n))))} \\ _Andrew Howroyd_, Jun 21 2018
%Y Cf. A032005, A032006, A032007.
%K nonn
%O 0,3
%A _Christian G. Bower_
%E a(0)=1 prepended by _Alois P. Heinz_, Sep 05 2015
|
