Search Results for ""

An alternating permutation is an arrangement of the elements c_1, ..., c_n such that no element c_i has a magnitude between c_(i-1) and c_(i+1) is called an alternating (or ...

Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

An elliptic partial differential equation given by del ^2psi+k^2psi=0, (1) where psi is a scalar function and del ^2 is the scalar Laplacian, or del ^2F+k^2F=0, (2) where F ...

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

The decimal expansion of the natural logarithm of 10 is given by ln10=2.302585092994045684... (1) (OEIS A002392). It is also given by the BBP-type formulas ln10 = (2) = ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...