the lucas sequences is a sequence of polynomials in $s,t$ defined recursively by $\{0\} = 0, \{1\} = 1,$ and $\{n\} = s \{n-1\} + t \{n-2\}$ for $n \geq 2$. on specialization of $s$ and $t$ one can recover the fibonacci numbers, the nonnegative integers, and the $q$-integers $[n]_q$. given a quantity which is expressed in terms of products and quotients of positive integers, one obtains a lucas analogue by replacing each factor of $n$ in the expression with $\{n\}$. it is then natural to ask if the resulting rational function is actually a polynomial in $s$ and $t$ and, if so, what it counts. using lattice paths, we give a combinatorial model for the lucas analogue of the binomial coefficients. this is joint work with curtis bennett, juan carrillo, and john machacek. we then give an algebraic method for proving polynomiality using a connection with cyclotomic polynomials. this part of the talk is joint work with jordan tirrell and based on an idea of richard stanley. finally, we also consider catalan numbers and their relatives, such as those for finite coxeter groups.