Search Results for ""

Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...

A polyhedral graph having nine vertices. There are 2606 nonisomorphic nonahedral graphs, as first enumerated by Federico (1969; Duijvestijn and Federico 1981). Named ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.