Search Results for ""
551 - 560 of 13135 for binary numberSearch Results
Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...
1. Zero is a number. 2. If a is a number, the successor of a is a number. 3. zero is not the successor of a number. 4. Two numbers of which the successors are equal are ...
The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...
There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...
The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...
The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...
Champernowne's constant C=0.12345678910111213... (1) (OEIS A033307) is the number obtained by concatenating the positive integers and interpreting them as decimal digits to ...
The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...
The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...
Wolfram (2002, p. 123) considered the sequence related to the Collatz problem obtained by iterating w_n={3/2w_(n-1) for w_(n-1) even; 3/2(w_(n-1)+1) for w_(n-1) odd (1) ...
...