ﻻ يوجد ملخص باللغة العربية
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly found by the recurrence relations.
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the recurrence relation
Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $sum_{k=0}^{p-1}binom akbinom{-1-a}kfrac p{k+b}pmod {p^2}$. For $n=0,1,2,ldots$ let $D_n$ and $b_n$ be Domb and Almkvist-Zudil
Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $pm 1({rm mod}, L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a Fibonacci pseudopri
We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of them, wit
The generalized Fibonacci sequences are sequences ${f_n}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t in mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent paper, Amdeberhan,