Combinatorial Interpretations of a Generalization of the Genocchi Numbers
Michael Domaratzki · 2004
We consider a natural generalization of the well-studied Genocchi numbers first proposed by Han. This generalization proves useful in enumerating the class of deterministic finite automata (DFA) that accept a finite language, and in enumerating a generalization of permutations counted by Dumont. 1