The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors p n (s), whose zeros lie all on the 'critical line' ℜ s = 1/2 or on the real axis (called critical polynomials). The transforms are identified in terms of combinatorial sums related to H. W. Gould's S:4/3, S:4/2 and S:3/1 binomial coefficient forms. Their 'critical polynomial' factors are then identified as variants of the S:4/1 form, and more compactly in terms of certain 3 F 2 (1) hypergeometric functions. Furthermore, we extend these results to a 1-parameter family of polynomials with zeros only on the critical line. These polynomials possess the functional equation p n (s; β) = ±p n (1 − s; β), similar to that for the Riemann xi function.It is shown that via manipulation of the binomial factors, these 'critical polynomials' can be simplified to an S:3/2 form, which after normalisation yields the rational function q n (s). The denominator of the rational form has singularities on the negative real axis, and so q n (s) has the same 'critical zeros' as the 'critical polynomial' p n (s). Moreover as s → ∞ along the real axis, q n (s) → 1 from below, mimicking 1/ζ(s) on the real axis.In the case of the Chebyshev parameters we deduce the simpler S:2/1 binomial form, and with C n the nth Catalan number, s an integer, we show that polynomials 4C n−1 p 2n (s) and C n p 2n+1 (s) yield integers with only odd prime factors. The results touch on analytic number theory, special function theory, and combinatorics.The authors would like to thank Dr J. L. Hindmarsh and Prof. M N Huxley for their helpful comments and suggestions. 2010 Mathematics Subject Classification: 11B65 (primary), 05A10, 33C20, 33C45, 42C05, 44A20, 30D05 (secondary).