(11C) Tribonacci Sequence

12142017, 12:21 PM
(This post was last modified: 12142017 12:33 PM by Gamo.)
Post: #1




(11C) Tribonacci Sequence
The Tribonacci Sequence is a generalization of the Fibonacci sequence where each term is the sum of the three preceding terms.
The sequence begins 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149,. . . . Input the Nth number Example: 7 A result 24 _______10 A result 149 Code:
Gamo 

12142017, 09:34 PM
(This post was last modified: 12142017 10:11 PM by Dieter.)
Post: #2




RE: (11C) Tribonacci Sequence
(12142017 12:21 PM)Gamo Wrote: The Tribonacci Sequence is a generalization of the Fibonacci sequence where each term is the sum of the three preceding terms. Interesting formula. But implemented waaayyy too complicated. ;) Actually it's nothing more than u · v^{n} with u and v being two constants. So what about this one: Code: LBL C Or simply... Code: LBL C Dieter 

12152017, 12:03 AM
(This post was last modified: 12152017 12:09 AM by StephenG1CMZ.)
Post: #3




RE: (11C) Tribonacci Sequence
I am a little confused as to how a tribonacci sequence can be a generalisation of a Fibonacci  though to be fair Wikipedia also uses that terminology.
I'd have thought a tribonacci would be a variation, but an nbonacci capable of handling any number of summations would be a generalisation. But my main reason for posting isn't to quibble, but to enquire. I always find it helpful to think of applications to help focus upon the maths. Fibonacci always makes me think of rabbits, though I am sure that is not it's only use. Does the Tribonacci sequence have any practical use? Stephen Lewkowicz (G1CMZ) Baker's dozen: eleven plus two is an anagram of twelve plus one 

12152017, 03:23 AM
Post: #4




RE: (11C) Tribonacci Sequence  
« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)