No CrossRef data available.
Article contents
Some number theoretic properties of arbitrary order recursive sequences
Published online by Cambridge University Press: 17 April 2009
Abstract
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
- Type
- Abstracts of Australasian PhD theses
- Information
- Bulletin of the Australian Mathematical Society , Volume 14 , Issue 1 , February 1976 , pp. 149 - 151
- Copyright
- Copyright © Australian Mathematical Society 1976
References
[1]Gould, H.W., “Some combinatorial identities of Bruckman. A systematic treatment with relation to the older literature”, Fibonacci Quart. 10 (1972), 613–627.Google Scholar
[2]Hilton, A.J.W., “The number of spanning trees of labelled wheels, fans and baskets”, The Proceedings of the Oxford Conference on Combinatorics (1972).Google Scholar
[3]Horadam, A.F., “Generating functions for powers of a certain generalised sequence of numbers”, Duke Math. J. 32 (1965), 437–446.CrossRefGoogle Scholar
[4]Horadam, E.M., “The Euler ф function for generalized integers”, Proc. Amer. Math. Soc. 14 (1963), 754–762.Google Scholar
[5]Lucas, Edouard, The theory of simply periodic numerical functions (translated by Kravitz, Sidney. Fibonacci Association, California, 1969).Google Scholar
[6]Selmer, Ernst S., Linear recurrence relations over finite fields (Department of Mathematics, University of Bergen, Norway, 1966).Google Scholar
[7]Ward, Morgan, “A calculus of sequences”, Amer. J. Math. 58 (1936), 255–266.CrossRefGoogle Scholar
[8]Williams, H.C., “On a generalization of the Lucas functions”, Acta Arith. 20 (1972), 33–51.CrossRefGoogle Scholar
You have
Access