Search Results for ""

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The confluent hypergeometric function of the first kind _1F_1(a;b;z) is a degenerate form of the hypergeometric function _2F_1(a,b;c;z) which arises as a solution the ...

A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...

The Nagel line is the term proposed for the first time in this work for the line on which the incenter I, triangle centroid G, Spieker center Sp, and Nagel point Na lie. ...