Search Results for ""
321 - 330 of 1366 for fibonacci seriesSearch Results
(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...
A function that can be defined as a Dirichlet series, i.e., is computed as an infinite sum of powers, F(n)=sum_(k=1)^infty[f(k)]^n, where f(k) can be interpreted as the set ...
Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
The modern definition of the q-hypergeometric function is _rphi_s[alpha_1,alpha_2,...,alpha_r; beta_1,...,beta_s;q,z] ...
A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...
The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...
There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...
Let z be defined as a function of w in terms of a parameter alpha by z=w+alphaphi(z). (1) Then Lagrange's inversion theorem, also called a Lagrange expansion, states that any ...
Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...
...
View search results from all Wolfram sites (26993 matches)

