TOPICS

# Search Results for " function cleanQuery(html){ let doc = new DOMParser().parseFromString(html, 'text/html'); return doc.body.textContent || ""; } var params = new URLSearchParams(window.location.search); var queryValue; if(params.get('query') != null){ document.write(cleanQuery(params.get('query'))); document.title = cleanQuery(params.get('query'))+' - Wolfram Search'; queryValue = params.get('query'); } if(params.get('q') != null){ document.write(cleanQuery(params.get('q'))); document.title = cleanQuery(params.get('q'))+' - Wolfram Search'; queryValue = params.get('q'); } "

1 - 10 of 42 for FactorialsSearch Results
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 ...
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 double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...
The central factorials x^([k]) form an associated Sheffer sequence with f(t) = e^(t/2)-e^(-t/2) (1) = 2sinh(1/2t), (2) giving the generating function ...
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 triangle coefficient is function of three variables written Delta(abc)=Delta(a,b,c) and defined by Delta(abc)=((a+b-c)!(a-b+c)!(-a+b+c)!)/((a+b+c+1)!), (Shore and Menzel ...
The function defined by U(n)=(n!)^(n!). The values for n=0, 1, ..., are 1, 1, 4, 46656, 1333735776850284124449081472843776, ... (OEIS A046882).
The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...
A factorion is an integer which is equal to the sum of factorials of its digits. There are exactly four such numbers: 1 = 1! (1) 2 = 2! (2) 145 = 1!+4!+5! (3) 40585 = ...
The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...
1|2|3|4|5

...