scispace - formally typeset
Open AccessJournal Article

The Fibonacci numbers.

Charles Safran
- 01 Jul 1991 - 
- Vol. 8, Iss: 4, pp 204-207
Reads0
Chats0
About
This article is published in M.D. computing : computers in medical practice.The article was published on 1991-07-01 and is currently open access. It has received 66 citations till now. The article focuses on the topics: Fibonacci number & Fibonacci polynomials.

read more

Citations
More filters
Book

My numbers, my friends

TL;DR: My numbers, my friends, My numbers and my friends as mentioned in this paper, کتابخانه دیجیتال دانشگاه آزاد اسلامی خوراس

Binet's formula for the tribonacci sequence

TL;DR: The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms as discussed by the authors. But such a definition might not be entirely satisfactory, because the computation of any term could require the computations of all of its predecessors.
Journal ArticleDOI

A symmetric algorithm for hyperharmonic and Fibonacci numbers

TL;DR: An explicit formula for hyperharmonic numbers, general generating functions of the Fibonacci and Lucas numbers are obtained and a symmetric algorithm obtained by the recurrence relation a n k = a n - 1 k + a nk - 1 is introduced.
Journal ArticleDOI

On Starlike Functions Connected with \(k\)-Fibonacci Numbers

TL;DR: In this paper, a new subclass SL k of star-like functions which are related to a shell-like curve is presented, where the coefficients of such functions are connected with k-Fibonacci numbers Fk,n defined recurrently by Fk 0 = 0, Fk 1 = 1 and Fk n = kF k,n + Fk,n−1 for n ≥ 1, where k is a given positive real number.

Fibonacci-Like Sequence and its Properties

TL;DR: In this paper, Binet's formula and generating function of Fibonacci-like sequence are defined and the associated initial conditions are the sum of initial conditions of the two sequences respectively.