A281579 Lexicographically earliest sequence such that, for any n>0, a(n)=length of the n-th run of consecutive terms in arithmetic progression in this sequence.
2, 2, 3, 3, 3, 4, 5, 4, 3, 3, 3, 3, 4, 5, 6, 7, 6, 5, 4, 4, 4, 3, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 4, 4, 4, 5, 6, 7, 6, 5, 4, 4, 4, 2, 2, 3, 3, 3, 4, 5, 6, 5, 4, 3, 3, 3, 3, 4, 5, 6, 5, 4, 3, 2, 2
Offset: 1
Keywords
Examples
a(1)=2 fits the definition (and a(1)=1 would not, because whatever a(2) is, (a(1),a(2)) is an arithmetic progression of length 2). a(2)=2 also fits the definition. (a(1), a(2)) constitutes the first run, and has length a(1)=2. a(3) cannot equal 2 (as it would extend the previous run). a(3)=3 fits the definition. (a(2),a(3)) constitutes the second run, and has length a(2)=2. a(4) cannot equal 2 (as a(5) would be equal to 1, which is impossible). a(4)=3 fits the definition. We complete the 3rd run with a(5)=3.
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Rémy Sigrist, PARI program for A281579
Comments