New Sums Identities In Weighted Catalan Triangle With The Powers Of Generalized Fibonacci And Lucas Numbers

نویسندگان

  • Emrah Kilic
  • Aynur Yalçiner
چکیده

In this paper, we consider a generalized Catalan triangle de…ned by km n 2n n k for positive integer m: Then we compute the weighted half binomial sums with the certain powers of generalized Fibonacci and Lucas numbers of the form n X k=0 2n n+ k km n X tk; where Xn either generalized Fibonacci or Lucas numbers, t and r are integers for 1 m 6: After we describe a general methodology to show how to compute the sums for further values of m. 1. Introduction Shapiro [6] derived the following triangle similar to Pascal’s triangle with entries given by Bn;k = k n 2n n k ; which called Catalan triangle because the Catalan numbers Cn = 1 n+1 2n n are the entries in the …rst column. Shapiro derived sums identities from the Catalan triangle. For example, he gave the following identities: n X p=1 (Bn;p) 2 = C2n 1 and n X p=1 Bn;pBn+1;p = C2n: We also refer to [5] and references therein for other examples. 2000 Mathematics Subject Classi…cation. 11B37. Key words and phrases. Catalan triangle, sums identites, partial binomial sum, recursions. 1 2 EMRAH KILIÇ AND AYNUR YALÇINER The authors [4] gave also an alternative proof of the identities above and established the following identity: n X p=1 (pBn;p) 2 = (3n 2)C2(n 1): In a somewhat di¤erent from the Catalan triangle, K¬l¬ç and Ionascu [2] derived the following result: for any a 2 C f0g ; n X p=1 2n n+ k a + a k = 1 an (a+ 1) 2n + (n+ 1)Cn: The authors also gave applications to the generalized Fibonacci and Lucas sequences, de…ned by Un = AUn 1 + Un 2; Vn = AVn 1 + Vn 2; where U0 = 0; U1 = 1; and V0 = 2; V1 = A; respectively. The Binet forms are Un = n n and Vn = n + n where ; = (A p )=2 and = A + 4: For example, we recall one result from [2]: n X

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large primes in generalized Pascal triangles

In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective implementation of ECPP method is presented which enables Magma computer algebra system to prove the primality of numbers with more than 1000 decimal digits. 1 ...

متن کامل

Catalan Triangle Numbers and Binomial Coefficients

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac–Moody algebras. We prove that any binomial coefficient can be written as weighted sums along rows of the Catalan triangle. The coefficients in the sums form a triangular array, which we call the alternating Jacobsthal triangle. We study various subs...

متن کامل

Certain General Binomial-fibonacci Sums

Numerous writers appear to have been fascinated by the many interesting summation identitites involving the Fibonacci and related Lucas numbers. Various types of formulas are discussed and various methods are used. Some involve binomial coefficients [2 ] , [4 ] . Generating function methods are used in [2] and [5] and higher powers appear in [6] . Combinations of these or other approaches appea...

متن کامل

Some New Binomial Sums Related to the Catalan Triangle

In this paper, we derive many new identities on the classical Catalan triangle C = (Cn,k)n>k>0, where Cn,k = k+1 n+1 ( 2n−k n ) are the well-known ballot numbers. The first three types are based on the determinant and the fourth is relied on the permanent of a square matrix. It not only produces many known and new identities involving Catalan numbers, but also provides a new viewpoint on combin...

متن کامل

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences

In this paper we find closed forms of the generating function ∞ ∑ k=0 U r nx , for powers of any non-degenerate second-order recurrence sequence, Un+1 = aUn+bUn−1, a +4b 6= 0, completing a study began by Carlitz [1] and Riordan [4] in 1962. Moreover, we generalize a theorem of Horadam [3] on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2014