|
%I #27 Jun 04 2018 10:00:30
%S 0,1,1,3,7,20,56,182,589,2088,7522,28820,113092,464477,1955760,
%T 8541860,38215077,176316928,832181774,4033814912,19973824386,
%U 101257416701,523648869394,2765873334372,14883594433742,81646343582385,455752361294076,2589414185398032
%N Number of ballot sequences of length n having exactly 1 largest part.
%C Also number of standard Young tableaux with last row of length 1.
%C Column k=1 of A238123.
%C With different offset column k=2 of A238750.
%H Joerg Arndt and Alois P. Heinz, <a href="/A238124/b238124.txt">Table of n, a(n) for n = 0..70</a>
%e The a(5)=20 ballot sequences of length 5 with 1 maximal element are (dots for zeros):
%e 01: [ . . . . 1 ]
%e 02: [ . . . 1 . ]
%e 03: [ . . . 1 2 ]
%e 04: [ . . 1 . . ]
%e 05: [ . . 1 . 2 ]
%e 06: [ . . 1 1 2 ]
%e 07: [ . . 1 2 . ]
%e 08: [ . . 1 2 1 ]
%e 09: [ . . 1 2 3 ]
%e 10: [ . 1 . . . ]
%e 11: [ . 1 . . 2 ]
%e 12: [ . 1 . 1 2 ]
%e 13: [ . 1 . 2 . ]
%e 14: [ . 1 . 2 1 ]
%e 15: [ . 1 . 2 3 ]
%e 16: [ . 1 2 . . ]
%e 17: [ . 1 2 . 1 ]
%e 18: [ . 1 2 . 3 ]
%e 19: [ . 1 2 3 . ]
%e 20: [ . 1 2 3 4 ]
%p h:= proc(l) local n; n:=nops(l); add(i, i=l)!/mul(mul(1+l[i]-j+
%p add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n)
%p end:
%p g:= proc(n, i, l) `if`(n=0, 0, `if`(i=1, h([l[], 1$n]),
%p add(g(n-i*j, i-1, [l[], i$j]), j=0..n/i)))
%p end:
%p a:= n-> g(n, n, []):
%p seq(a(n), n=0..30);
%t b[n_, l_List] := b[n, l] = If[n < 1, x^l[[-1]], b[n - 1, Append[l, 1]] + Sum[If[i == 1 || l[[i - 1]] > l[[i]], b[n - 1, ReplacePart[l, i -> l[[i]] + 1]], 0], {i, 1, Length[l]}]]; a[0] = 0; a[n_] := Coefficient[b[n - 1, {1}], x, 1]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Feb 10 2015, after A238123 *)
%o (PARI) A238124(n)=A238123(n,1) \\ _M. F. Hasler_, Jun 03 2018
%Y Cf. A238123, A238750.
%K nonn
%O 0,4
%A _Joerg Arndt_ and _Alois P. Heinz_, Feb 21 2014
|
