criteria to verify log-convexity of sequences is presented. Iterating this criteria produces infinitely log-convex sequences. As an application, several classical examples of sequences arising in Combinatorics and Special Functions are presented. The paper concludes with a conjecture regarding coefficients of chromatic polynomials.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.