Displaying 1-7 of 7 results found.
page
1
Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a progression of the form p, p-2*q, p-q, where q >= 0.
+10
6
1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 3, 1, 1, 2, 4, 3, 3, 4, 3, 2, 2, 4, 4, 2, 2, 5, 1, 1, 3, 1, 1, 2, 4, 4, 5, 1, 1, 3, 1, 1, 5, 4, 5, 3, 6, 5, 6, 5, 4, 6, 6, 4, 3, 4, 3, 3, 4, 3, 6, 2, 6, 5, 7, 3, 6, 6, 3, 2, 7, 6, 7, 5, 5, 2, 2, 6, 2, 2, 4, 5, 1, 1, 2, 1, 1, 5, 2, 6, 7
COMMENTS
This sequence avoids one of the six permutations of a set of three integers in arithmetic progression. For example, the set {1,2,3} can be ordered as tuples (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). In this sequence, we avoid (3,1,2) and other progressions of the form p, p-2*q, p-q, for all q >= 0.
Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a weakly decreasing arithmetic progression.
+10
6
1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 2, 1, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 5, 4, 4, 5, 1, 3, 2, 4, 1, 1, 2, 1, 3, 2, 4, 2, 5, 1, 2, 2, 1, 3, 3, 4, 3, 4, 5, 2, 4, 3, 5, 5, 6, 3, 4, 3, 6, 4, 4, 5, 5, 4, 5, 5, 6, 6, 7, 6, 6, 7, 7, 5, 8, 6, 8, 6, 7, 7, 2, 7, 7, 2, 8
PROG
(PARI) \\ See Links section.
Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a progression of the form p, p+q, p-q, where q >= 0.
+10
5
1, 1, 2, 1, 1, 2, 2, 3, 3, 2, 3, 2, 4, 1, 3, 2, 1, 3, 2, 3, 4, 1, 2, 3, 4, 3, 4, 4, 5, 4, 1, 5, 5, 4, 1, 4, 2, 5, 5, 6, 5, 5, 6, 6, 7, 7, 3, 7, 6, 6, 8, 6, 6, 5, 7, 7, 8, 7, 1, 8, 8, 9, 9, 8, 5, 3, 9, 9, 10, 9, 6, 8, 8, 5, 9, 9, 5, 8, 6, 10, 1, 7, 10, 6, 6, 4, 4, 8, 3, 10
COMMENTS
This sequence avoids one of the six permutations of a set of three integers in arithmetic progression. For example, the set {1,2,3} can be ordered as tuples (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). In this sequence, we avoid (2,3,1) and other progressions of the form p, p+q, p-q, for all q >= 0.
Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a progression of the form c, c+2d, c+d, where d >= 0.
+10
5
1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 3, 1, 1, 4, 4, 3, 2, 3, 3, 4, 4, 5, 4, 4, 5, 5, 1, 1, 4, 1, 1, 5, 5, 6, 5, 1, 1, 6, 1, 1, 2, 2, 5, 2, 2, 5, 6, 6, 7, 2, 2, 7, 2, 2, 8, 7, 6, 5, 6, 8, 8, 9, 5, 6, 9, 8, 9, 2, 2, 7, 3, 2, 8, 2, 3, 8, 7, 3, 7, 4, 1, 1, 6, 1, 1, 9, 8
COMMENTS
This sequence avoids one of the six permutations of a set of three integers in arithmetic progression. For example, the set {1,2,3} can be ordered as tuples (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). In this sequence, we avoid (1,3,2) and other progressions of the form c, c+2d, c+d, for all d >= 0.
Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, a(n+2*k) <> max(a(n), a(n+k)).
+10
4
0, 0, 1, 0, 0, 1, 2, 3, 4, 0, 0, 1, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 10, 11, 0, 0, 1, 0, 0, 1, 12, 13, 4, 0, 0, 1, 0, 0, 1, 6, 5, 4, 7, 8, 9, 14, 15, 6, 16, 10, 5, 17, 11, 10, 7, 8, 3, 2, 5, 2, 3, 18, 19, 20, 21, 3, 2, 12, 2, 3, 13, 22, 2, 11, 2, 10, 23
Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form a progression of the form p, p-q, p+q, where q >= 0.
+10
3
1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 2, 1, 1, 2, 2, 4, 3, 2, 6, 5, 5, 6, 3, 4, 3, 4, 1, 1, 2, 1, 1, 2, 2, 3, 3, 1, 1, 2, 1, 1, 2, 2, 6, 4, 2, 4, 6, 8, 6, 5, 8, 4, 6, 2, 7, 5, 11, 5, 5, 7, 6, 11, 4, 9, 6, 7, 9, 7, 5, 4, 3, 8, 9, 5, 5, 8, 3, 5, 3, 3, 1, 1, 2, 1, 1, 2
COMMENTS
This sequence avoids one of the six permutations of a set of three integers in arithmetic progression. For example, the set {1,2,3} can be ordered as tuples (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). In this sequence, we avoid (2,1,3) and other progressions of the form p, p-q, p+q, for all q >= 0.
Lexicographically earliest sequence such that for any distinct j, k, m that are the side lengths of a triangle, a(j), a(k), and a(m) are not the side lengths of a triangle.
+10
2
1, 1, 1, 2, 1, 3, 5, 1, 8, 13, 21, 2, 34, 55, 89, 1, 144, 233, 4, 377, 610, 987, 1597, 1, 17, 2584, 4181, 6765, 10946, 17711, 3, 72, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 1, 7, 305, 832040, 1346269, 2178309, 3524578, 41, 5702887, 1292, 9227465
COMMENTS
In a triangle, the sum of any two side lengths is greater than that of the third, so that x + y > z. The empty triangle (or line) is not counted, which means that x + y cannot be equal to z. In practice, if we have two side lengths x and y, we can find their sum s and their difference d, which tells us that side z must fall in the range d < z < s to form a triangle.
For n>0, A002620(n+1) gives the number of combinations of three indices whose corresponding terms cannot be the side lengths of a triangle in this sequence.
It appears that the local maxima are the Fibonacci numbers A000045 (except for 1s).
The second-largest values in the log graph, falling roughly on a line, appear to be A001076 (half of the even Fibonacci numbers).
Generalizing the sequence to prohibit the side lengths of any n-gon at distinct n-gonal indices gives A011782.
EXAMPLE
a(3)=1 because the indices 1,2,3 could not be the side lengths of a triangle, so there is no restriction and the smallest number is chosen.
a(7) cannot be 1 because a(3)=1, a(5)=1, and a(7)=1 could be the side lengths of a triangle at indices which are also side lengths of a triangle.
a(7) cannot be 2 because a(4)=2, a(6)=3, and a(7)=2 are side lengths of a triangle at indices that forbid it.
a(7) cannot be 3 because a(5)=1, a(6)=3, and a(7)=3 also make a triangle at indices that forbid it.
a(7) cannot be 4 because a(4)=2, a(6)=3 and a(7)=4 form a triangle at unsuitable indices.
a(7) can be 5 without contradiction, so a(7)=5.
Search completed in 0.005 seconds
|