General approach in computing sums of products of binary sequences

General approach in computing sums of products of binary sequences

In this paper we nd a general approach to nd closed forms of sums of products of arbitrary sequences satisfying the same recurrence with di erent initial conditions. We apply successfully our technique to sums of products of such sequences with indices in (arbitrary) arithmetic progressions. It generalizes many results from literature. We propose also an extension where the sequences satisfy di erent recurrences.

___

  • [1] Belbachir H. and Bencherif, F. Sums of products of generalized Fibonacci and Lucas num- bers, Arxiv:0708.2347v1, 2009.
  • [2] Cerin, Z. Sums of products of generalized Fibonacci and Lucas numbers, Demons. Math., 42 (2), 247{258, 2009.
  • [3] Cerin, Z. On Sums of Products of Horadam Numbers, Kyungpook Math. J., 49, 483{492, 2009.
  • [4] Cerin, Z. and Gianella G.M. On sums of squares of Pell-Lucas numbers, Integers 6 A15, 16 pp., 2006.
  • [5] Cerin, Z. Alternating sums of Fibonacci products, Atti Semin. Mat. Fis. Univ. Modena Reggio Emilia 53 (2), 331{344, 2005.
  • [6] Cerin, Z. Some alternating sums of Lucas numbers, Cent. Eur. J. Math. 3 (1) , 1{13, 2005.
  • [7] Klc, E. Sums of the squares of terms of sequence fung, Proc. Indian Acad. Sci. 118 (1), 27{41, 2008.
  • [8] Koshy, T. Fibonacci and Lucas numbers with applications, Pure and Appl. Math., Wiley- Interscience, New York, 2001.
  • [9] Mead, D.G. Problem B-67, Fibonacci Quart. 3 (4), 326{327, 1965.
  • [10] Melham, R.S. On sums of powers of terms in a linear recurrence, Portugal. Math. 56 (4), 501{508, 1999.
  • [11] Rao, K.S. Some properties of Fibonacci numbers, The Amer. Math. Monthly, 60, 680{684, 1953.
  • [12] Vajda, S. Fibonacci & Lucas numbers, and the golden section, John Wiley & Sons, Inc.,New York, 1989.