General Fibonacci Numbers: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{ | {{ConstantsFlag}} | ||
General Fibonacci numbers generalize the idea behind the Fibonacci and Lucas numbers, and can be written as a function of two additional variables <math>a, b</math> - the two starting values of the sequence. | |||
<math> | |||
G(a,b,n) = G(a,b,n-1) + G(a,b,n-2) | |||
</math> | |||
<math> | |||
G(a,b,0) = a | |||
</math> | |||
<math> | |||
G(a,b,1) = b | |||
</math> | |||
Latest revision as of 00:34, 12 January 2018
 |
Mathematical Constants
Irrational Numbers: Euler-Mascheroni Constant · Sqrt2 · Phi · Sqrt3 · e · Sqrt5 · Sqrt6 · Sqrt7 · Sqrt8 · Pi · Sqrt10 · Sqrt11 · Pi to the Pi Prime Numbers: Prime Numbers · Palindromic Primes · Prime Generating Polynomials · Belphegors Prime Sequences: Fibonacci Numbers · Lucas Numbers · General Fibonacci Numbers Number Forms: Fermat Numbers · Mersenne Primes · Counting and Combinatorics: Catalan Numbers · Shannon Number · Eddington Number Tetration and Knuth's Up Notation: Tetration Factoring and Number Theory: Divisibility · Totient Function Games: Four Fours · Five Fives
|
General Fibonacci numbers generalize the idea behind the Fibonacci and Lucas numbers, and can be written as a function of two additional variables $ a, b $ - the two starting values of the sequence.
$ G(a,b,n) = G(a,b,n-1) + G(a,b,n-2) $
$ G(a,b,0) = a $
$ G(a,b,1) = b $