The binomial interpolated transform of a sequence is a generalization of the wellknown binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing on binary recurrences. We give the sums of the elements in rows and in rising diagonals, and we define two special classes of these arithmetical triangles.

The purpose of the present paper is to prove that there are finitely many binomial coefficients of the form (f in certain binary recurrences, and give a simple method for the determination of these coefficients. We illustrate the method by the Fibonacci, the Lucas, and the Pell sequences. First, we transform both of the title equations into two elliptic equations and apply a theorem of Mordell ...

In many chronic conditions, subjects alternate between an active and an inactive state, and sojourns into the active state may involve multiple lesions, infections, or other recurrences with different times of onset and resolution. We present a biologically interpretable model of such chronic recurrent conditions based on a queueing process. The model has a birth-death process describing recurr...

An (infinite) sequence is a function from the set IN = {0, 1, 2, . . .} of natural numbers to some set S. If a : IN → S is a sequence, we often denote a(n) by an. The values a0, a1, a2, . . . are called the elements or terms of the sequence. A recurrence relation is a way of defining a sequence. A few of the first elements of the sequence are given explicitly. Then, the recurrence relation give...