Abstract
This note provides asymptotic formulas for approximating the sequence factorial of members of a finite arithmetic progression by using Stirling, Burnside and other more accurate asymptotic formulas for large factorials that have appeared in the literature.
Acknowledgements
The author wishes to thank the referees for the helpful comments.