By considering the specialisation $s_{lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $lambda$ in terms of two properties of the boxes in the diagram f
or $lambda$. Using specialisations of symplectic and orthogonal Schur functions, we derive corresponding formulae, first given by El Samra and King, for the number of semistandard symplectic and orthogonal $lambda$-tableaux.
We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schroder paths and give a bijection between the set of increasing rectangular tableaux and small $m$-Schroder path
s, generalizing a result of Pechenik [3]. Using $K$-jeu de taquin promotion, which was defined by Thomas and Yong [10], we give a cyclic sieving phenomenon for the set of increasing hook tableaux.
