Rémy Sigrist, <a href="/A364057/b364057_1.txt">Table of n, a(n) for n = 1..10000</a>
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
Rémy Sigrist, <a href="/A364057/b364057_1.txt">Table of n, a(n) for n = 1..10000</a>
reviewed
approved
proposed
reviewed
editing
proposed
proposed
approved
editing
proposed
In the 74 initially published terms, numbers on average seem to reoccur at (very) roughly twice the index of their previous occurrence. This seems worthy of better quantification when further terms are established. - Peter Munn, Nov 03 2023
Lexicographically earliest infinite sequence of positive integers such that any every subsequence {a(j), a(j+k), a(j+2k)} (for any j and , k >= 1) is unique.
1. Every subsequence {a(n-2m2k), a(n-mk) a(n)} created by a(n) must be unique.
After a(For n >= 3), , a(n) != a(n+1).
approved
editing
reviewed
approved