## Combinatorialists are interested in sequences of integers which count things. We often find that the same sequence counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. In this way, unexpected connections have come
Some canonical sequences of integers
โ Scribed by M. Bernstein; N.J.A. Sloane
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 795 KB
- Volume
- 226-228
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Klarner, D.A. and K. Post, Some fascinating integer sequences, Discrete Mathematics 106/107 (1992) 303-309. A class of recursively defined sets of integers is investigated. Their asymptotic densities and recognizability by a suitable finite automaton are illustrated by an example.
## Abstract For a recursively defined sequence __u__ : = (__u~n~__) of integers, we describe the subgroup __t~u~__ (๐) of the elements __x__ of the circle group ๐ satisfying lim~__n__~ __u~n~x__ = 0. More attention is dedicated to the sequences satisfying a secondorder recurrence relation. In this