login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A369422 Lexicographically earliest infinite sequence such that no two equal unordered pairs (a(j), a(k)) have the same distance abs(j-k). 0
1, 1, 2, 3, 4, 2, 5, 6, 3, 7, 8, 4, 9, 10, 11, 5, 12, 13, 6, 14, 15, 16, 7, 17, 18, 8, 19, 20, 21, 9, 22, 23, 10, 24, 25, 11, 26, 27, 28, 12, 29, 30, 13, 31, 32, 33, 14, 34, 35, 15, 36, 37, 16, 38, 39, 40, 17, 41, 42, 18, 43, 44, 45, 19, 46, 47, 20, 48, 49, 21, 50, 51, 52, 22, 53, 54, 23, 55, 56, 57, 24, 58, 59, 25, 60, 61 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
In other words: The absolute distance between the indices of any two terms (A and B) is distinct among all pairs of terms in the sequence with the same two values (A and B).
No value can occur more than twice: 1) If two terms have the same value, one term must be at an odd index and the other at an even index. Otherwise we would have a middle term B equidistant from two equal terms in an ABA-form progression, which contradicts the sequence's definition. 2) So we can have at most one term with a given value at an even index and one at an odd index.
Any unordered pair (A, B) has a maximum of 4 distinct distances (A1 to B1, A1 to B2, A2 to B1, A2 to B2).
For the equivalent sequence using ordered pairs, see A337226.
LINKS
EXAMPLE
a(7)=5: We cannot have a(7)=1 because then, for example, the unordered pair (1,2) would have the same absolute distance twice at distinct indices:
1, 1, 2, 3, 4, 2, 1
1--2 2--1
a(7) could not equal 2 because again the pair (1,2) would have the same absolute distance twice at different indices (i=6-1=5 and i=7-2=5):
1, 1, 2, 3, 4, 2, 2
1--------------2
1--------------2
a(7) cannot be 3 because of the following two equal unordered pairs, which would have the same distance:
1, 1, 2, 3, 4, 2, 3
2--3 2--3
a(7) cannot be 4, or we would have two equal unordered pairs both with distance 1:
1, 1, 2, 3, 4, 2, 4
4--2
2--4
a(7) can be 5 without restriction since 5 is a first occurrence and every unordered pair with 5 has a distinct distance.
CROSSREFS
Cf. A136119, A184119 (conjectured first and second occurrences).
Sequence in context: A157000 A026346 A340791 * A361020 A368693 A333235
KEYWORD
nonn,more
AUTHOR
Neal Gersh Tolunsky, Jan 22 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 15:49 EDT 2024. Contains 375073 sequences. (Running on oeis4.)