Abstract
The Bernoulli numbers B n may be defined by means of the generating function
. An example of a “lacuary” recurrence for these numbers is
. This recurrence has lacunae, or gaps, or length 6. That is, to compute B 6n , it is not necessary to know the values of B j for all j < 6n; we need only know the values of B 6j for j = 0, 1, ..., n - 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berndt, B.C. Ramanujan’s Notebooks, Part IV. New York: Springer-Verlag, 1994.
Chellali, M. “Accélération de calcul de nombres de Bernoulli.” J. Number Theory, Vol. 28 (1988) : Ap. 347–362.
Comtet, L. Advanced Combinatorics. Dordrecht: Reidel, 1974.
Howard, F.T. “Formulas of Ramanujan Involving Lucas Numbers, Pell Numbers, and Bernoulli Numbers.” Applications of Fibonacci Numbers. Volume 6. Edited by G.E. Bergum, A.N. Philippou and A.F. Horadam, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
Howard, F.T. “Generalizations of a Fibonacci Identity.” Applications of Fibonacci Numbers. Volume 8. Edited by Fredric T. Howard, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999.
Howard, F.T .T. “A Tribonacci Identity.” The Fibonacci Quarterly Vol. 39 (2001): pp. 352–357.
Howard, F.T. “A Sequence of Numbers Related to the Exponential Function.” Duke Mathematical Journal, Vol. 34 (1967): pp. 599–616.
Howard, F.T. “Some Sequences of Rational Numbers Related to the Exponential Function.” Duke Mathematical Journal, Vol. 34 (1967): pp. 701–716.
Howard, F.T. “Numbers Generated by the Reciprocal of e x — x — 1.” Mathematics of Computation Vol. 31 (1977): pp. 581–598.
Lehmer, D.H. “Lacunary Recurrence Formulas for the Numbers of Bernoulli and Euler.” Annals of Math., Vol. 36 (1935): pp. 637–649.
Ramanujan, S. “Some Properties of Bernoulli’s Numbers.” J. Indian Math. Society, Vol. 3 (1911): pp. 219–234.
Riordan, J. Combinatorial Identities. New York: Wiley, 1968.
Yalavigi, C.C. Bernoulli and Lucas Numbers.” The Mathematics Education, Vol. 4 (1971): pp. 99–102.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Howard, F.T. (2004). A General Lacunary Recurrence Formula. In: Howard, F.T. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-0-306-48517-6_13
Download citation
DOI: https://doi.org/10.1007/978-0-306-48517-6_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6545-2
Online ISBN: 978-0-306-48517-6
eBook Packages: Springer Book Archive