Number of entries are not divisible by x in the n th row of triangle

102 Views Asked by At

I recently read the method for finding the number of entries that are not divisible by x(is a prime) in the nth row of Pascal's triangle. Similarly how to find number of entries not divisible by x(is a prime) in the nth row of triangle formed by the Stirling numbers of the second kind?