Search Results for ""

The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...

An inverse permutation is a permutation in which each number and the number of the place which it occupies are exchanged. For example, p_1 = {3,8,5,10,9,4,6,1,7,2} (1) p_2 = ...

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

The mode of a set of observations is the most commonly occurring value. For example, for a data set (3, 7, 3, 9, 9, 3, 5, 1, 8, 5) (left histogram), the unique mode is 3. ...

The octahemioctahedron, also called the octatetrahedron, is the uniform polyhedron with Maeder index 3 (Maeder 1997), Wenninger index 68 (Wenninger 1989), Coxeter index 37 ...

Consider the decimal expansion of the reciprocal of the number seven, 1/7=0.142857142857...=0.142857^_, (1) which is a repeating decimal. Now take overlapping pairs of these ...

A pandiagonal perfect magic cube is a perfect magic cube that remains perfect when any single orthogonal section is "restacked" cyclically so that the ordering of any set of ...

A polyare is a polyform formed from a polyomino by removing of half of each square such that at least half of the original join between squares is retained. The first few ...

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

A number n is said to be refactorable, sometimes also called a tau number (Kennedy and Cooper 1990), if it is divisible by the number of its divisors sigma_0(n), where ...