%I #3 Mar 30 2012 16:50:11
%S 1,1,1,1,2,1,1,4,3,1,1,8,11,4,1,1,16,50,26,5,1
%N Triangle read by rows giving number of pure shifted complexes in k dimensions on n nodes (n >= 1, 0 <= d <= n-1).
%D C. Klivans, Obstructions to shiftedness, Discrete Comput. Geom., 33 (2005), 535-545.
%e Triangle begins:
%e 1
%e 1 1
%e 1 2 1
%e 1 4 3 1
%e 1 8 11 4 1
%e 1 16 50 26 5 1
%K nonn,tabl
%O 1,5
%A _N. J. A. Sloane_, Mar 23 2005