TOPICS
Search

Search Results for ""


41 - 50 of 730 for Rising Factorial PowerSearch Results
The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...
The q-analog of the factorial (by analogy with the q-gamma function). For k an integer, the q-factorial is defined by [k]_q! = faq(k,q) (1) = ...
The alternating factorial is defined as the sum of consecutive factorials with alternating signs, a(n)=sum_(k=1)^n(-1)^(n-k)k!. (1) They can be given in closed form as ...
The first few values of product_(k=1)^(n)k! (known as a superfactorial) for n=1, 2, ... are given by 1, 2, 12, 288, 34560, 24883200, ... (OEIS A000178). The first few ...
In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...
A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...
The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...
The Pochhammer symbol (x)_n = (Gamma(x+n))/(Gamma(x)) (1) = x(x+1)...(x+n-1) (2) (Abramowitz and Stegun 1972, p. 256; Spanier 1987; Koepf 1998, p. 5) for n>=0 is an ...
The probability of getting a positive result for a given test which should produce a positive result.
The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...
1|2|3|4|5|6|7|8 ... 73 Previous Next

...