Skip to main content

All Questions

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3 votes
0 answers
89 views

Recursion for reversed rows of the A373183 using unsigned Stirling numbers of the first kind

Let $\left[{n \atop k}\right]$ be unsigned Stirling numbers of the first kind. Here $$ \left[{n \atop k}\right] = (n-1)\left[{n-1 \atop k}\right] + \left[{n-1 \atop k-1}\right], \\ \left[{n \atop 0}\...
Notamathematician's user avatar
1 vote
0 answers
59 views

Simple recursion for the A329369 using Stirling numbers of both kinds

Let $s(n,k)$ be a (signed) Stirling number of the first kind. Let $n \brace k$ be a Stirling number of the second kind. Let $a(n)$ be A329369 (i.e, number of permutations of ${1,2,...,m}$ with ...
Notamathematician's user avatar