Search Results for ""

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 Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...

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 ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...