Abstract
MacMahon’s definition of self-inverse composition is extended ton-colour self-inverse composition. This introduces four new sequences which satisfy the same recurrence relation with different initial conditions like the famous Fibonacci and Lucas sequences. For these new sequences explicit formulas, recurrence relations, generating functions and a summation formula are obtained. Two new binomial identities with combinatorial meaning are also given.
Similar content being viewed by others
References
Agarwal A K, Properties of a recurring sequence,The Fibonacci Quart. 27(2) (1989) 169–175
Agarwal A K,n-colour compositions,Indian J. PureAppl. Math. 31(11) (2000) 1421–1427
Agarwal A K, An analogue of Euler’s identity and new combinatorial properties ofn-colour compositions,J. Comput. Appl. Math. 160 (2003) 9–15
Agarwal A K and Andrews G E, Rogers-Ramanujan identities for partitions with ‘N copies ofN’,J. Combin. Theory A45(1) (1987) 40–49
Carlson B C, Special function of applied mathematics (1977) (New York: Academic Press)
MacMahon P A, Combinatory analysis (2001) (New York: AMS Chelsea Publishing) vol.I, II
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Narang, G., Agarwal, A.K. n-Colour self-inverse compositions. Proc. Indian Acad. Sci. (Math. Sci.) 116, 257–266 (2006). https://doi.org/10.1007/BF02829743
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02829743