Search Results for ""

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

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...

Divide a triangle by its three medians into six smaller triangles. Surprisingly, the circumcenters O_(AB), O_(BA), etc. of the six circumcircles of these smaller triangles ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the ...

Van der Corput's constant is given by m = 2sqrt(2)int_0^(sqrt(pi/2-c))cos(x^2+c)dx (1) = 2pi[coscC(phi)-sincS(phi)] (2) = 3.3643175781... (3) (OEIS A143305), where C(x) and ...

The van der Grinten projection is a map projection given by the transformation x = (1) y = sgn(phi)(pi|PQ-Asqrt((A^2+1)(P^2+A^2)-Q^2)|)/(P^2+A^2), (2) where A = ...

The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting y=y^'. It is an ...