For n>=1, a(n) is equal to the number of functions f:{1,2...,n}->{1,2,3,4,5,6,7,8,9} such that for a fixed x in {1,2,...,n} and a fixed y in {1,2,3,4,5,6,7,8,9} we have f(x)<>y. - Aleksandar M. Janjic and Milan Janjic, Mar 27 2007
a(n) is the number of compositions of n when there are 8 types of each natural number. - Milan Janjic, Aug 13 2010
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.