Loading…
Note Concerning an Odd Langford Sequence
It is shown that the set {1, 2,⋯ , 2 n+ 3} − {p } can be partitioned into differences 1, 3,⋯ , 2 n+ 1 precisely whenn≥ 1, p is odd and (n, p) ≠= (1, 3). All sets whose elements are in arithmetic progression and which can be partitioned into differences that are again in arithmetic progression are cl...
Saved in:
Published in: | European journal of combinatorics 2001-01, Vol.22 (1), p.79-83 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | It is shown that the set {1, 2,⋯ , 2 n+ 3} − {p } can be partitioned into differences 1, 3,⋯ , 2 n+ 1 precisely whenn≥ 1, p is odd and (n, p) ≠= (1, 3). All sets whose elements are in arithmetic progression and which can be partitioned into differences that are again in arithmetic progression are classified. |
---|---|
ISSN: | 0195-6698 1095-9971 |
DOI: | 10.1006/eujc.2000.0437 |