Search Results for ""

Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

Pogson's ratio is the constant 100^(1/5)=10^(2/5)=2.511886431... (OEIS A189824) appearing in the definition of the astronomical magnitude (brightness) scale. This scale is ...

Given a plane ax+by+cz+d=0 (1) and a point x_0=(x_0,y_0,z_0), the normal vector to the plane is given by v=[a; b; c], (2) and a vector from the plane to the point is given by ...

The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...

Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...

A polyabolo is an analog of the polyomino composed of n isosceles right triangles joined along edges of the same length. Polyaboloes are sometimes also called polytans ...

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

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...