In 2008, Spivey found a recurrence relation for the Bell numbers. We consider the probabilistic r-Bell polynomials associated with which are a probabilistic extension of the r-Bell polynomials. Here Y is a random variable whose moment generating function exists in some neighborhood of the origin . The aim of this paper is to generalize the relation for the Bell numbers to that for the probabilistic r-Bell polynomials associated with Y.
In this paper, a generalized recurrence relation for the $r$-Whitney numbers of the second kind is derived using as framework the operators $X$ and $D$ satisfying the commutation relation $DX-XD=1$. This recurrence relation is shown to be a generalization of the well-known Spivey's Bell number. Moreover, several other identities generalizing Spivey's Bell number formula are obtained.
This paper introduces an alternative form of the derivation of Spivey's Bell number formula which involves the $q$-Boson operators $a$ and $a^{\dagger}$. Furthermore, a similar formula for the case of the $(q,r)$-Dowling polynomials is obtained, and is shown to produce a generalization of the latter.
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this paper, we investigate a homogeneous recurrence relation that, in a way, extends the linear recurrence of the Fibonacci sequence for two variables, called {\it double-recurrence Fibonacci numbers}, given by ${F(m,n) = F(m-1, n-1)+F (m-2, n-2)}$, for $n,m\geq 2$, where $F (m, 0) = F_m$, $F (m, 1) = F_{m+1}$, $F (0, n) = F_n$ and $F (1, n) = F_{n+1}$. We exhibit a…
Recently, a new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced. The mathematical background goes back to the regular mosaics in the hyperbolic plane. In this article, we investigate the paths in the hyperbolic Pascal triangle corresponding to the regular mosaic $\{4,5\}$, in which the binary recursive sequences $f_{n}=αf_{n-1}\pm f_{n-2}$ are represented ($α\in\mathbb{N}^+$).
In this paper we investigate special generalized Bernoulli polynomials with a,b,c parameters that generalize classical Bernoulli numbers and polynomials. The present paper deals with some recurrence formulae for the generalization of poly-Bernoulli numbers and polynomials with a,b,c parameters. Poly-Bernoulli numbers satisfy certain recurrence relationships which are used in many computations involving poly-Bernoulli numbers. Obtaining a closed formula for generalization of poly-Bernoulli numbers with a,b,c paramerers therefore seems to be a natural and important problem. By using the generali…
We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and induction. By using a new method, we prove one interesting divisibility result with super Catalan numbers.
In \cite{luo2006,luosri2005}, Luo and Srivastava introduced some generalizations of the Apostol -Bernoulli polynomials and the Apostol-Euler polynomials. The main object of this paper is to extend the result of \cite{prevost2010} to these generalized polynomials. More precisely, using the Padé approximation of the exponential function, we obtain recurrence relations for Apostol-Bernoulli, Euler and also Genocchi polynomials of higher order. As an application we prove lacunary relation for some particular cases.
We define the generalized-Euler-constant function $γ(z)=\sum_{n=1}^{\infty} z^{n-1} (\frac{1}{n}-\log \frac{n+1}{n})$ when $|z|\leq 1$. Its values include both Euler's constant $γ=γ(1)$ and the "alternating Euler constant" $\log\frac{4}π=γ(-1)$. We extend Euler's two zeta-function series for $γ$ to polylogarithm series for $γ(z)$. Integrals for $γ(z)$ provide its analytic continuation to $\C-[1,\infty)$. We prove several other formulas for $γ(z)$, including two functional equations; one is an inversion relation between $γ(z)$ and $γ(1/z)$. We generalize Somos's quadratic recurrence constant an…
We introduce and study a `level two' generalization of the poly-Bernoulli numbers, which may also be regarded as a generalization of the cosecant numbers. We prove a recurrence relation, two exact formulas, and a duality relation for negative upper-index numbers.
There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a survey of results in this area, focusing on recent results of the authors.
Schreier sets have been an object of study since first introduced in 1930 by Jozef Schreier to construct a counterexample to a conjecture of Banach. In 1974 George Andrews found interesting connections between these sets and Fibonacci number, and since then more results of a combinatorial flavor were proven by Chu, Beanland, and Finch-Smith. In parallel Iannucci introduced the concept of a small divisor and characterized all natural numbers whose small divisors are in arithmetic progression, results which were generalized by Chentouf and Chu. Then combining these two ideas, Chu introduced the …
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci sequence, Pell sequence, Jacobsthal sequence, and the Balancing sequence of numbers. The paper also provides several approaches in solving the linear recurrence relation under consideration. We end the paper by giving out an open problem.
A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the coefficients of the Fibonacci numbers in the decomposition to be zero or $\pm 1$, the resulting expression is known as the far-difference representation. Alpert proved that a far-difference representation exists and is unique under certain restraints that generalize non-consecutiveness, specifically that two adjacent summands of the same sign must be at lea…
By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent elements; this is called a legal decomposition. Previous work examined the distribution of the number of summands and the spacings between them, in legal decompositions arising from the Fibonacci numbers and other linear recurrence relations with non-negative integral coefficients. Many of these results were restricted to the case where the first term in th…
The poly-Bernoulli numbers and its relative are defined by the generating series using the polylogarithm series, and we call them type $B$ and $C$, respectively. As a generalization of these poly-Bernoulli numbers, we introduce Schur type poly-Bernoulli numbers and investigate their properties. First, we define a generalization of Arakawa-Kaneko multiple zeta functions and obtain their expression in terms of Schur type Bernoulli numbers. Next, under the restriction to the hook type, we define a generalization of Kaneko-Tsumura multiple zeta functions and obtain similar expression in terms of S…
Let $K$ be a field. In this article, we derive a formula for the discriminant of a sequence $\{r_{A,n}+c r_{A,n-1}\}$ of polynomials. Here, $c \in K$ and $\{r_{A,n} \}$ is a sequence of polynomials satisfying a certain recurrence relation that is considered by Ulas or Turaj. There are several works calculating the discriminants of given polynomials. For example, Kaneko--Niiho and Mahlburg--Ono independently proved the formula for the discriminants of certain hypergeometric polynomials that are related to $j$-invariants of supersingular elliptic curves. Sawa--Uchida proved the formula for the d…
Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1=1$ and $F_2=2$. The distribution of the number of summands in such decomposition converges to a Gaussian, the gaps between summands converges to geometric decay, and the distribution of the longest gap is similar to that of the longest run of heads in a biased coin; these results also hold more generally, though for technical reasons previous work needed to assume the coefficients in the re…
In this paper, we consider a generalization of Horadam sequence {w_n} which is defined by the recurrence w_n = aw_n-1 + cw_n-2; if n is even, w_n = bw_n-1 + cw_n-2; if n is odd with arbitrary initial conditions w_0, w_1 and nonzero real numbers a, b, and c. We investigate some congruence properties of the generalized Horadam sequence {w_n}.
