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.

A215266 Number of solid standard Young tableaux of cylindrical shape lambda X 2, where lambda ranges over all partitions of n.

This page as a plain text file.
%I A215266 #14 Jul 19 2017 20:39:43
%S A215266 1,1,4,26,258,3346,54108,1054256,24161966,634230122,18806776982,
%T A215266 622011916184,22754818956246,912075762692584,39755634279964662,
%U A215266 1872279469323840472,94783193260373606758,5135585509536795416348,296656123838796109849526,18200829821539972354967252
%N A215266 Number of solid standard Young tableaux of cylindrical shape lambda X 2, where lambda ranges over all partitions of n.
%H A215266 S. B. Ekhad, D. Zeilberger, <a href="https://arxiv.org/abs/1202.6229">Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux</a>, arXiv:1202.6229v1 [math.CO], 2012
%H A215266 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%p A215266 b:= proc(l) option remember; local m; m:= nops(l);
%p A215266       `if`({map(x-> x[], l)[]}minus{0}={}, 1, add(add(`if`(l[i][j]>
%p A215266       `if`(i=m or nops(l[i+1])<j, 0, l[i+1][j]) and l[i][j]>
%p A215266       `if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
%p A215266        j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
%p A215266     end:
%p A215266 g:= proc(n, i, l) `if`(n=0 or i=1, b(map(x->[2$x], [l[], 1$n])),
%p A215266        add(g(n-i*j, i-1, [l[], i$j]), j=0..n/i))
%p A215266     end:
%p A215266 a:= n-> g(n, n, []):
%p A215266 seq(a(n), n=0..12);
%Y A215266 Column k=2 of A215204.
%K A215266 nonn
%O A215266 0,3
%A A215266 _Alois P. Heinz_, Aug 07 2012