**
**

**Hinz, Andreas M. (2017): The Lichtenberg sequence. In: Fibonacci Quarterly, Vol. 55, No. 1: pp. 2-12**

**Full text not available from 'Open Access LMU'.**

## Abstract

The discovery of two passages from 1769 by the German Georg Christoph Lichtenberg and the Japanese Yoriyuki Arima, respectively, sheds some new light on the early history of integer sequences and mathematical induction. Both authors deal with the solution of the ancient Chinese rings puzzle, where metal rings are moved up and down on a very sophisticated mechanical arrangement. They obtain the number of (necessary) moves to solve it in the presence of n rings. While Lichtenberg considers all moves, Arima concentrates on the down moves only of the first ring. We will present a unified view on integer sequences and discuss some of their most fundamental representatives before collecting properties of the Lichtenberg sequence l(n), defined mathematically by the recurrence l(n) + l(n-1) = 2(n) - 1, and related sequences such as the Jacobsthal sequence, which is the sequence of differences of l. And, of course, at some point Fibonacci numbers will enter the scene.

Item Type: | Journal article |
---|---|

Faculties: | Mathematics, Computer Science and Statistics > Mathematics |

Subjects: | 500 Science > 510 Mathematics |

ISSN: | 0015-0517 |

Language: | English |

Item ID: | 55634 |

Date Deposited: | 14. Jun 2018, 09:59 |

Last Modified: | 14. Jun 2018, 09:59 |