Simple counting on restricted n-ary k-tuples
I have some simple counting problems, for example, how many n-ary k-tuples, i.e. (v0,v1,…,vk) with 0≤vi<n, are there which have v0=1, and m non-zero coordinates.
What sort of functionality is there is Sage or other computer algebra systems for answering such questions for general n,k and m?