Related papers: Partial sums of the Gibonacci sequence

We investigate various properties of p-adic differential equations which have as a solution an analytic function of the form $F_k (x) = \sum_{n\geq 0} n! P_k (n) x^n$, where $P_k (n) = n^k + C_{k-1} n^{k-1} + ...+ C_0$ is a polynomial in n…

A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…

In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…

As a generalization of planar Fibonacci spirals that are based on the recurrence relation $F_n=F_{n-1}+F_{n-2}$, we draw assembled spirals stemming from analytic solutions of the recurrence relation $G_n=a\, G_{n-1}+b\, G_{n-2}+c\, d\,^n$,…

Pak-Robichaux recently introduced a signed puzzle rule for Schubert structure constants, which they use to show that sums $\gamma_k(n)$ of these constants with a bounded number of inversions are polynomial. We give a different, conceptual…

Let f(z) = sum_n a(n) n^{(k-1)/2} e(nz) be a cusp form for Gamma_0(N), character chi and weight k geq 4. Let q(x) = x^2 + sx + t be a polynomial with integral coefficients. It is shown that sum_{n \leq X} a(q(n)) = cX + O(X^{6/7+eps}) for…

For a finite set $A\subset\mathbb{N}$ and $k\in \mathbb{N}$, let $\omega_k(A) = \sum_{i\in A, i\neq k}1$. For each $n\in \mathbb{N}$, define $$a_{k, n}\ =\ |\{E\subset \mathbb{N}\,:\, E = \emptyset\mbox{ or } \omega_k(E) < \min E\leqslant…

In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…

We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…