Permutation sum
Is there a closed form for the following sum?
Sum{i=0 to n} [(n!/(n-i)!)*x^i]
This is almost the form of the binomial theorem, with the coefficients
being the number of permutations rather than combinations.
.
Relevant Pages
- Re: Permutation sum
... This is almost the form of the binomial theorem, with the coefficients ... being the number of permutations rather than combinations. ... According to Mathematica, there is a closed form using the incomplete Gamma ...
(sci.math) - Re: It is just an iterated line !!!
... is there a pattern to the Ps and Qs as n ... coefficients of X going up by 3 each time and the coefficient of ... Catalan numbers. ... but without a closed form I'm scuppered. ...
(sci.math) - Re: Iteration square root of arcsinh
... I'm not holding my breath for a closed form, ... Glad you're not holding your breath. ... those coefficients ... k matrixpowers of S1 and then k matrixpowers of -0.5*SL only. ...
(sci.math) - Re: 100 bucks revisited
... matter, coins/notes unlimited). ... Here is a closed form of this number. ... With coefficients being functions of mod, bounded and periodic ... recurrence relations such as these. ...
(sci.math) - Re: Fourier Series Square Wave
... This is a problem that may be solved in closed form and without the ... need for a computer to determine the coefficients. ... "odd" so will not have cosine terms. ... Prev by Date: ...
(sci.math) |
|
