Search Results for ""

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

The Wallis formula follows from the infinite product representation of the sine sinx=xproduct_(n=1)^infty(1-(x^2)/(pi^2n^2)). (1) Taking x=pi/2 gives ...

The central factorials x^([k]) form an associated Sheffer sequence with f(t) = e^(t/2)-e^(-t/2) (1) = 2sinh(1/2t), (2) giving the generating function ...

Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...

Let A and B be two classes of positive integers. Let A(n) be the number of integers in A which are less than or equal to n, and let B(n) be the number of integers in B which ...

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

The nth cubic number n^3 is a sum of n consecutive odd numbers, for example 1^3 = 1 (1) 2^3 = 3+5 (2) 3^3 = 7+9+11 (3) 4^3 = 13+15+17+19, (4) etc. This identity follows from ...

The Pell-Lucas polynomials Q(x) are the w-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. The first few are Q_1(x) = 2x (1) Q_2(x) ...