z-logo
open-access-imgOpen Access
k-Step Sum and m-Step Gap Fibonacci Sequence
Author(s) -
Μαρία Αδάμ,
Nicholas Assimakis
Publication year - 2014
Publication title -
isrn discrete mathematics
Language(s) - English
Resource type - Journals
ISSN - 2090-7788
DOI - 10.1155/2014/374902
Subject(s) - algorithm , artificial intelligence , computer science
For two given integers k , m , we introduce the k -step sumand m -step gap Fibonacci sequence by presenting a recurrence formula that generates the n th term as the sum of k successive previous terms starting the sum at the m th previous term. Known sequences, like Fibonacci, tribonacci, tetranacci, and Padovan sequences, are derived for specific values of k , m . Two limiting properties concerning the terms of the sequence are presented. The limits are related to the spectral radius of the associated { 0 , 1 } -matrix.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom