Search Results for ""
621 - 630 of 2819 for Integer sequenceSearch Results
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 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 ...
Polykites are polyforms obtained from a regular triangular grid superposed on a regular hexagonal grid (its dual), illustrated above. The monokite is therefore a ...
There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...
Consider the sequence {x_n}_(n=0)^infty defined by x_0=1 and x_(n+1)=[3/2x_n], where [z] is the ceiling function. For n=0, 1, ..., the first few terms are 1, 2, 3, 5, 8, 12, ...
A number n is practical if for all k<=n, k is the sum of distinct proper divisors of n. Defined in 1948 by A. K. Srinivasen. All even perfect numbers are practical. The ...
A prime circle of order 2n is a free circular permutation of the numbers from 1 to 2n with adjacent pairs summing to a prime. The number of prime circles for n=1, 2, ..., are ...
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. ...
An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...
...
View search results from all Wolfram sites (344225 matches)

