W.Y.C. Chen, E.Y.P. Deng and L.L.M. Yang,
Riordan paths and derangements,
Discrete Math. 308(11) (2008) 2222-2227.

Cited by

  1. O. Aichholzer, A. Asinowski and T. Miltzow, Disjoint compatibility graph of non-crossing matchings of points in convex position, Electron. J. Combin. 22 (2015) Paper 1.65, 53 pp.

  2. B. Balof and J. Menashe, Semiorders and Riordan numbers, J. Integer Seq. 10 (2007) Article 07.7.6, 18 pp.

  3. E. Cohen, T. Hansen and N. Itzhaki, From entanglement witness to generalized Catalan numbers, Scientific reports (2016) 6:30232, 10 pp.

  4. S. Kitaev, Patterns in Permutations and Words, Springer Science & Business Media, 2011.

  5. Z.S. Mei and S.J. Wang, Pattern avoidance of generalized permutations, arXiv:1804.06265.

  6. G.Z. Qin and Sherry H.F. Yan, Cycles in the graph of overlapping permutations avoiding barred patterns, Electron. J. Combin. 23 (2016) Paper 3.57, 24 pp.

  7. M. Shattuck, On the zeros of some polynomials with combinatorial coefficients, Annales Mathematicae et Informaticae 42 (2013) 93-101.