Papers
Topics
Authors
Recent
Search
2000 character limit reached

Convolution identities for Tribonacci numbers with symmetric formulae

Published 8 Oct 2016 in math.NT | (1610.02559v2)

Abstract: Many kinds of convolution identities have been considered about several numbers, including Bernoulli, Euler, Genocchi, Cauchy, Stirling, and Fibonacci numbers. The well-known basic result about Bernoulli numbers is due to Euler. The convolution identities have been studied. In this paper, we give convolution identities for Tribonacci numbers without binomial coefficients and with binomial coefficients. Convolution identities of Fiboancci numbers or Lucas numbers can be expressed in the form of linear combinations of Fibonacci numbers and Lucas numbers only. Fibonacci numbers and Lucas numbers are in pairs with different values. Covolution identities of Tribonacci numbers can be expressed in the linear combination of several Tribonacci numbers with different values. Symmetric formulas are basic tools for these expressions.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.