Quantcast
Channel: How to solve a complex recursive relation - MathOverflow
Browsing all 2 articles
Browse latest View live

Answer by მამუკაჯიბლაძე for How to solve a complex recursive relation

With $S(0)=0$ one has$$S(n)=-\sum_{k=1}^n\frac{F_k}{k!}$$where $F_k$ are the Fubini numbers (also known as ordered Bell numbers). The proof is contained in my comments above, given that the exponential...

View Article


How to solve a complex recursive relation

Before I get started, let me say for complete disclosure this question came up while I was solving a problem from https://projecteuler.net/.I've been trying to find a non-recursive representation of...

View Article
Browsing all 2 articles
Browse latest View live