login
A103574
Triangle read by rows giving number of pure shifted complexes in k dimensions on n nodes (n >= 1, 0 <= d <= n-1).
0
1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 8, 11, 4, 1, 1, 16, 50, 26, 5, 1
OFFSET
1,5
REFERENCES
C. Klivans, Obstructions to shiftedness, Discrete Comput. Geom., 33 (2005), 535-545.
EXAMPLE
Triangle begins:
1
1 1
1 2 1
1 4 3 1
1 8 11 4 1
1 16 50 26 5 1
CROSSREFS
Sequence in context: A329332 A092056 A362903 * A112682 A033185 A217781
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Mar 23 2005
STATUS
approved