Search Results for ""

The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...

A homographic transformation x_1 = (ax+by+c)/(a^('')x+b^('')y+c^('')) (1) y_1 = (a^'x+b^'y+c^')/(a^('')x+b^('')y+c^('')) (2) with t_1 substituted for t according to ...

A 16-sided polygon, sometimes also called a hexakaidecagon. The regular hexadecagon is a constructible polygon, and the inradius r, circumradius R, and area A of the regular ...

A two-player game in which player 1 chooses any finite game and player 2 moves first. A pseudoparadox then arises as to whether the hypergame is itself a finite game.

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...

Niven's theorem states that if x/pi and sinx are both rational, then the sine takes values 0, +/-1/2, and +/-1. Particular cases include sin(pi) = 0 (1) sin(pi/2) = 1 (2) ...