Search Results for ""

The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...

The Lucas numbers are the sequence of integers {L_n}_(n=1)^infty defined by the linear recurrence equation L_n=L_(n-1)+L_(n-2) (1) with L_1=1 and L_2=3. The nth Lucas number ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

Machin-like formulas have the form mcot^(-1)u+ncot^(-1)v=1/4kpi, (1) where u, v, and k are positive integers and m and n are nonnegative integers. Some such formulas can be ...

The Mittag-Leffler function (Mittag-Leffler 1903, 1905) is an entire function defined by the series E_alpha(z)=sum_(k=0)^infty(z^k)/(Gamma(alphak+1)) (1) for alpha>0. It is ...

In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...