Combinatorial Sums \sum_{k\equiv r(\mbox{mod} m)}{n\choose k}a^k and Lucas Quotients (II)

Publication date 17 September 2016

Abstract: In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum

sum_{kequiv r(mbox{mod}m)}{nchoose k}a^k.

In this paper, we show that the sum can be expressed in terms of some recurrent sequences with orders not exceeding

v a r p h i (m)

and give some new congruences.

This page was built for publication: Combinatorial Sums $\sum_{k\equiv r(\mbox{mod} m)}{n\choose k}a^k$ and Lucas Quotients (II)