A214722
Number A(n,k) of solid standard Young tableaux of shape [[{n}^k],[n]]; square array A(n,k), n>=0, k>=1, read by antidiagonals.
Original entry on oeis.org
1, 1, 1, 1, 2, 2, 1, 3, 16, 5, 1, 4, 91, 192, 14, 1, 5, 456, 5471, 2816, 42, 1, 6, 2145, 143164, 464836, 46592, 132, 1, 7, 9724, 3636776, 75965484, 48767805, 835584, 429, 1, 8, 43043, 91442364, 12753712037, 55824699632, 5900575762, 15876096, 1430
Offset: 0
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, ...
1, 2, 3, 4, 5, 6, ...
2, 16, 91, 456, 2145, 9724, ...
5, 192, 5471, 143164, 3636776, 91442364, ...
14, 2816, 464836, 75965484, 12753712037, 2214110119572, ...
42, 46592, 48767805, 55824699632, 70692556053053, 98002078234748974, ...
-
b:= proc(l) option remember; local m; m:= nops(l);
`if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
`if`(i=m or nops(l[i+1])
`if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
end:
A:= (n, k)-> b([[n$k], [n]]):
seq(seq(A(n, 1+d-n), n=0..d), d=0..10);
-
b[l_List] := b[l] = With[{m = Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]]] < j, 0, l[[i+1, j]]] && l[[i, j]] > If[Length[l[[i]]] == j, 0, l[[i, j+1]]], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]] - 1]]], 0], {j, 1, Length[l[[i]]]}], {i, 1, m}]] ]; a[n_, k_] := b[{Array[n&, k], {n}}]; Table[Table[a[n, 1+d-n], {n, 0, d}], {d, 0, 10}] // Flatten (* Jean-François Alcover, Dec 17 2013, translated from Maple *)
A213932
Number of solid standard Young tableaux of shape [[n,n,n],[n,n]].
Original entry on oeis.org
1, 5, 707, 268326, 168146839, 143163177336, 149998192424502, 182598353781240533, 249032962712552804432, 371285830572997665257695, 594729699502746726969433566, 1010574132470951359396337494800, 1804193873947216124589237862262262
Offset: 0
-
b:= proc(l) option remember; local m; m:= nops(l);
`if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
`if`(i=m or nops(l[i+1])
`if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
end:
a:= n-> b([[n, n, n], [n, n]]):
seq(a(n), n=0..10);
-
b[l_] := b[l] = With[{ m = Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]]] < j, 0, l[[i+1, j]]] && l[[i, j]] > If[Length[l[[i]]] == j, 0, l[[i, j+1]]], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]]-1]]], 0], {j, 1, Length[l[[i]]]}], {i, 1, m}]]]; a[n_] := b[{{n, n, n}, {n, n}}]; Table[a[n], {n, 0, 12}] (* Jean-François Alcover, Dec 18 2013, translated from Maple *)
A214638
Number of solid standard Young tableaux of shape [[n,n,n],[n],[n]].
Original entry on oeis.org
1, 6, 936, 379366, 249664758, 221005209058, 239143562020194, 299233941746052998, 417999868371999142276, 636568066798406010872120, 1039267652960081699025215774, 1796704965351078502372895796786, 3258764657213579008313421745034602
Offset: 0
-
b:= proc(l) option remember; local m; m:= nops(l);
`if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
`if`(i=m or nops(l[i+1])
`if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
end:
a:= n-> b([[n, n, n], [n], [n]]):
seq(a(n), n=0..10);
-
b[l_] := b[l] = With[{m := Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]]] < j, 0, l[[i+1, j]]] && l[[i, j]] > If[Length[l[[i]]] == j, 0, l[[i, j+1]]], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]]-1]]], 0], {j, 1, Length[l[[i]]]}], {i, 1, m}]] ]; a[n_] := b[{{n, n, n}, {n}, {n}}]; Table[a[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Dec 18 2013, translated from Maple *)
A214631
Number A(n,k) of solid standard Young tableaux of shape [[(n)^(k+1)],[n]^k]; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Original entry on oeis.org
1, 1, 1, 1, 2, 1, 1, 6, 16, 1, 1, 20, 936, 192, 1, 1, 70, 85800, 379366, 2816, 1, 1, 252, 9962680, 1825221320, 249664758, 46592, 1, 1, 924, 1340103744, 14336196893200, 89261675900020, 221005209058, 835584, 1
Offset: 0
Square array A(n,k) begins:
1, 1, 1, 1, 1, ...
1, 2, 6, 20, 70, ...
1, 16, 936, 85800, 9962680, ...
1, 192, 379366, 1825221320, 14336196893200, ...
1, 2816, 249664758, 89261675900020, 70351928759681296000, ...
-
b:= proc(l) option remember; local m; m:= nops(l);
`if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
`if`(i=m or nops(l[i+1])
`if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
end:
A:= (n, k)-> b([[n$(k+1)], [n]$k]):
seq(seq(A(n, d-n), n=0..d), d=0..8);
-
b[l_] := b[l] = With[{m = Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]] ] < j, 0, l[[i+1, j]] ] && l[[i, j]] > If[Length[l[[i]] ] == j, 0, l[[i, j+1]] ], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]]-1]]], 0], {j, 1, Length[l[[i]] ]}], {i, 1, m}]]]; a[n_, k_] := b[{Array[n&, k+1], Sequence @@ Array[{n}&, k]}]; Table[Table[a[n, d-n], {n, 0, d}], {d, 0, 8}] // Flatten (* Jean-François Alcover, Dec 18 2013, translated from Maple *)
Showing 1-4 of 4 results.
Comments