Search Results for ""

The de Bruijn constant, also called the Copson-de Bruijn constant, is the minimal constant c=1.1064957714... (OEIS A113276) such that the inequality ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...

An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...

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 q-analog of pi pi_q can be defined by setting a=0 in the q-factorial [a]_q!=1(1+q)(1+q+q^2)...(1+q+...+q^(a-1)) (1) to obtain ...

Van der Corput's constant is given by m = 2sqrt(2)int_0^(sqrt(pi/2-c))cos(x^2+c)dx (1) = 2pi[coscC(phi)-sincS(phi)] (2) = 3.3643175781... (3) (OEIS A143305), where C(x) and ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...