# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a214753
Showing 1-1 of 1
%I A214753 #36 Oct 05 2018 19:32:54
%S A214753 1,0,1,0,2,1,0,4,4,1,0,10,16,6,1,0,26,66,34,8,1,0,76,296,192,58,10,1,
%T A214753 0,232,1334,1134,406,88,12,1,0,764,6322,6716,2918,730,124,14,1,0,2620,
%U A214753 30930,40872,20718,6118,1186,166,16,1,0,9496,158008,255308,149826,50056,11310,1796,214,18,1
%N A214753 Number T(n,k) of solid standard Young tableaux of n cells and height = k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
%H A214753 Alois P. Heinz, Rows n = 0..20, flattened
%H A214753 S. B. Ekhad, D. Zeilberger, Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, arXiv:1202.6229 [math.CO], 2012
%H A214753 Wikipedia, Young tableau
%F A214753 T(n,k) = A215086(n,k) - A215086(n,k-1) for k>0, T(n,0) = A215086(n,0) = A000007(n).
%e A214753 Triangle T(n,k) begins:
%e A214753 1;
%e A214753 0, 1;
%e A214753 0, 2, 1;
%e A214753 0, 4, 4, 1;
%e A214753 0, 10, 16, 6, 1;
%e A214753 0, 26, 66, 34, 8, 1;
%e A214753 0, 76, 296, 192, 58, 10, 1;
%e A214753 0, 232, 1334, 1134, 406, 88, 12, 1;
%p A214753 b:= proc(n, k, l) option remember; `if`(n=0, 1,
%p A214753 b(n-1, k, [l[], [1]])+ add(`if`(i=1 or nops(l[i])