The sequence 1, 1, 2, 3, 5, 8, 13, 21, ..., known as Fibonacci sequence, has a long history and special importance in mathematics. This sequence came about as a solution to the famous rabbits' problem posed by Fibonacci in his landmark book, "Liber abaci" (1202). If the "n"th term of Fibonacci sequence is denoted by [f][subscript n], then it may…

In this article, the author takes up the special trinomial (1 + x + x[squared])[superscript n] and shows that the coefficients of its expansion are entries of a Pascal-like triangle. He also shows how to calculate these entries recursively and explicitly. This article could be used in the classroom for enrichment. (Contains 1 table.)