Search Results for ""

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...

Let u_(B,b)(n) be the number of digit blocks of a sequence B in the base-b expansion of n. The following table gives the sequence {u_(B)(n)} for a number of blocks B. B OEIS ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

The finite group C_2×C_2 is one of the two distinct groups of group order 4. The name of this group derives from the fact that it is a group direct product of two C_2 ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

A gamma distribution is a general type of statistical distribution that is related to the beta distribution and arises naturally in processes for which the waiting times ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

The great rhombicosidodecahedro is the 62-faced Archimedean solid with faces 30{4}+20{6}+12{10}. It is also known as the rhombitruncated icosidodecahedron, and is sometimes ...

A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...