cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213978 Number of solid standard Young tableaux of shape [[n,n,n],[n]].

Original entry on oeis.org

1, 3, 91, 5471, 464836, 48767805, 5900575762, 791402291063, 114754560003596, 17688389169462060, 2864042102057254739, 482894371222455465001, 84225614036198359288620, 15119622005825185224290830, 2782232873996840900804273236, 523114052492282720617167786279, 100231256005025286627952024093564, 19528383010645472628217323778258916
Offset: 0

Views

Author

N. J. A. Sloane, Jul 07 2012

Keywords

Comments

Ekhad-Zeilberger give 121 terms.

Crossrefs

Column k=3 of A214722.

Programs

  • Maple
    b:= proc(x, y, z, u) option remember; `if`({x, y, z, u}={0}, 1,
         `if`(x>y and x>u, b(x-1, y, z, u), 0)+`if`(y>z, b(x, y-1, z, u), 0)+
         `if`(z>0, b(x, y, z-1, u), 0)+`if`(u>0, b(x, y, z, u-1), 0))
        end:
    a:= n-> b(n$4):
    seq(a(n), n=0..20);  # Alois P. Heinz, Jul 19 2012
  • Mathematica
    b[x_, y_, z_, u_] := b[x, y, z, u] = If[Union[{x, y, z, u}] == {0}, 1, If[x>y && x>u, b[x-1, y, z, u], 0] + If[y>z, b[x, y-1, z, u], 0] + If[z>0, b[x, y, z-1, u], 0] + If[u>0, b[x, y, z, u-1], 0]]; a[n_] := b[n, n, n, n]; Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Mar 11 2014, after Alois P. Heinz *)

Formula

Conjecture: Limit n->infinity a(n)^(1/n) = 256. - Vaclav Kotesovec, Jul 17 2014