Search Results for ""

The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

Given a Euclidean n-space, H_n=n+1.

The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

A coefficient of the Maclaurin series of 1/(ln(1+x))=1/x+1/2-1/(12)x+1/(24)x^2-(19)/(720)x^3+3/(160)x^4+... (OEIS A002206 and A002207), the multiplicative inverse of the ...

Quasirandom numbers are numbers selected from a quasirandom sequence. Such numbers are useful in computational problems such as quasi-Monte Carlo integration.

One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...