Search Results for ""

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

An integer that is either 0 or positive, i.e., a member of the set Z^*={0} union Z^+, where Z-+ denotes the positive integers.

An integer that is either 0 or negative, i.e., a member of the set {0} union Z^-, where Z-- denotes the negative integers.

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

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

Let sum_(k=0)^(infty)a_k=a and sum_(k=0)^(infty)c_k=c be convergent series such that lim_(k->infty)(a_k)/(c_k)=lambda!=0. Then ...

The nonnegative integers 0, 1, 2, ....

A knot which is not alternating. Unlike alternating knots, flype moves are not sufficient to pass between all minimal diagrams of a given nonalternating knot (Hoste et al. ...