Abstract: In this paper,soml problems of counting the n umber of m level digital sequlnces of length n that satisfy some constraints are considered and their recursive formulas and explicit formulations arl given.A result of combinatorial lnumlration of kly codlwords is improved and some combinatorial identical relations are got.