Thanks!

My understanding is that Pascal's triangle is a recursively generated structure and thus infinite. Computers are finite, so there is no program that can calculate S(n, p), for all n, for all p. Thus, I don't think I can solve this problem.

According to Wikipedia, the sequence of increasing narcissistic numbers varies by the base used. In base two, the only narcissistic numbers are zero and 1. As another example, in base ten "six" is a narcissistic number, but in base five, "six" is not a narcissistic number. I didn't see a base specified in the posing of this question. Consequently, I find the question ill-posed.

"Read again CAREFULLY the description"

The description asks for the sum of the lowest positive numbers in the array. But, what is a lowest positive number in an array? I know the minimum of such numbers, but there exist many different ways to order numbers, and thus 'lowest' is not clear.

So, does this kata have a solution if the phrase "lowest positive number" is ambiguous?