## 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 fascinating integer sequences
โ Scribed by David A. Klarner; Karel Post
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 383 KB
- Volume
- 106-107
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
## 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
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as d e gree sequence. One of the criteria leads to a new and constructive proof of the well-known criterion of Erdos-Gallai. ## 1. Introduction Let (dl, .