Search Results for ""

Typesetting "errors" in which exponents or multiplication signs are omitted but the resulting expression is equivalent to the original one. Examples include 2^59^2=2592 (1) ...

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...

The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

A fractional integral of order 1/2. The semi-integral of t^lambda is given by D^(-1/2)t^lambda=(t^(lambda+1/2)Gamma(lambda+1))/(Gamma(lambda+3/2)), so the semi-integral of ...

A fractional derivative of order 1/2. The semiderivative of t^lambda is given by D^(1/2)t^lambda=(t^(lambda-1/2)Gamma(lambda+1))/(Gamma(lambda+1/2)), so the semiderivative of ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

An (n,k) fountain is an arrangement of n coins in rows such that exactly k coins are in the bottom row and each coin in the (i+1)st row touches exactly two in the ith row. ...

G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...