Search Results for ""

Polynomials m_k(x;beta,c) which form the Sheffer sequence for g(t) = ((1-c)/(1-ce^t))^beta (1) f(t) = (1-e^t)/(c^(-1)-e^t) (2) and have generating function ...

Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...

A metadrome is a number whose hexadecimal digits are in strict ascending order. The first few are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, ... ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...

A fractal curve created from the base curve and motif illustrated above (Lauwerier 1991, p. 37). As illustrated above, the number of segments after the nth iteration is ...

A second-order partial differential equation of the form Hr+2Ks+Lt+M+N(rt-s^2)=0, (1) where H, K, L, M, and N are functions of x, y, z, p, and q, and r, s, t, p, and q are ...

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...

Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...