Search Results for ""

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

The center of a Neuberg circle.

A polygon P is said to be simple (or a Jordan polygon) if the only points of the plane belonging to two polygon edges of P are the polygon vertices of P. Such a polygon has a ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

The edge of a polygon or face of a polyhedron are sometimes called sides.

A simple polygon with precisely two ears and one mouth.

A random polygon containing the origin (Kovalenko 1999).

A polygon whose vertex angles are equal (Williams 1979, p. 32).