Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 231922
3 votes
1 answer
318 views

Sum with Stirling numbers of the second kind

Let $wt(n)$ be A000120, number of $1$'s in binary expansion of $n$ (or the binary weight of $n$) and $$n=2^{t_1}(1+2^{t_2+1}(1+\dots(1+2^{t_{wt(n)}+1}))\dots)$$ Then we have an integer sequence given …
Notamathematician's user avatar
1 vote
0 answers
58 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 exceda …
Notamathematician's user avatar
1 vote
0 answers
84 views

Closed form for the family of polynomials

Let $s(n,k)$ be a (signed) Stirling number of the first kind. Let $R(n,x)$ be the family of polynomials such that $$ R(2n+1,x) = xR(n,x), \\ R(2n,x) = x(R(n,x+1) - R(n, x)), \\ R(0, x) = x $$ Let …
Notamathematician's user avatar
2 votes
1 answer
125 views

Recursion for the sum with 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 $$ f(n,m,i) = (-1)^{m-i+1}\sum\limits_{j=i}^{m+1}j^n s(j,i) {m+1 \brace …
Notamathematician's user avatar
3 votes
0 answers
87 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
2 votes
0 answers
117 views

Generalized identity with Stirling numbers of the second kind and falling factorials

It is known that Striling numbers of the second kind satisfy the relation $$ \sum\limits_{k=0}^{n}{n \brace k}(x)_k = x^n. $$ where $(x)_n$ is the falling factorials such that $$ (x)_n = x(x-1)(x-2)\d …
Notamathematician's user avatar