Skip to content
Research Article Open access CC BY 4.0

Matrix Form of the Iterated Binomial Transforms

Sergio Falcor

Journal of Advances in Mathematics and Computer Science · pp. 1–7 · Published 27 Jun 2016

10.9734/BJMCS/2016/25730

Abstract

In a previous paper, we have estudied the Binomial transforms of the k-Fibonacci sequences and later we have studied the iterated Binomial transforms of these sequences. Now we study the matrix form of these four different binomial transforms of integer sequences in such a way that we can find a relation between the terms of the transformed sequence and the terms of the initial sequence. In this form we do not need to find the initial terms of the transformed sequence to find the following term from the application of the corresponding recurrence equation. Later we will apply the obtained results to the particular case of the k-Fibonacci sequence.

Binomial Transforms Recurrence equation Pascal matrix k-Fibonacci numbers.

Cited by 1

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.