## 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
โฆ LIBER โฆ
Good sequences of integers
โ Scribed by David Carlson
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 518 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Some sequences of integers
โ
Peter J. Cameron
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 827 KB
Some canonical sequences of integers
โ
M. Bernstein; N.J.A. Sloane
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 795 KB
Sums of perturbed sequences of integers
โ
John R. Burke; William A. Webb
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 403 KB
Enumeration of sequences of nonnegative
โ
M. J. Hodel
๐
Article
๐
1974
๐
John Wiley and Sons
๐
English
โ 501 KB
On the addition of sequences of integers
โ
R.C. Vaughan
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 457 KB
Progressions in Sequences of Nearly Cons
โ
Noga Alon; Ayal Zaks
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 255 KB
For k>2 and r 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers [a 1 , a 2 , ..., a g ] with gaps a j+1 &a j # [1, ..., r], 1 j g&1 contains a k-term arithmetic progression. Brown and Hare proved that G(k, 2)>-(k&1)ร2 ( 43 ) (k&1)ร2 and that G(k,