Combinatorial interpretations of a generalization of the Genocchi numbers
J. Integer Seq. 7(3), Art. 04.3.6, 11 p., electronic only (2004)
Summary
Summary: 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.
Mathematics Subject Classification
05A15, 68Q45
Keywords/Phrases
Genocchi numbers, finite automata, enumeration of permutations
