Search Results for ""

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 polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...

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

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

The characteristic function f(n)={1 n is prime; 0 n otherwise (1) of primes has values 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, ... (OEIS A010051) for n=1, 2, ...

The prime distance pd(n) of a nonnegative integer n is the absolute difference between n and the nearest prime. It is therefore true that pd(p)=0 for primes p. 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. ...

The prime signature of a positive integer n is a sorted list of nonzero exponents a_i in the prime factorization n=p_1^(a_1)p_2^(a_2).... By definition, the prime signature ...