|Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6|
Abstract: 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.
(Concerned with sequences A001469 A064624 A064625 A065747 A065748 A065753 A065754 A065755 A065756 A065757 .)
Received August 19 2003; revised version received October 6 2004. Published in Journal of Integer Sequences October 7 2004.