[seqfan] Conjectured Recaman-type permutation

[Peter Munn]

Hi seqfans,

Following the earlier thread (see below), Ali Sada and I have agreed the
best place to start is a sequence as envisaged in the second comment in
A078943. I have devised a definition and am prepared to conjecture the
resulting sequence is a permutation. If anyone wants to contribute, this
is being drafted as A356080.

Peter

---------------------------- Original Message ----------------------------
Subject: [seqfan] Re: Is this permutation of the positive integers
achievable?
From:    "Ali Sada via SeqFan" <seqfan at list.seqfan.eu>
Date:    Wed, July 20, 2022 10:10 am
--------------------------------------------------------------------------

 Thank you, Peter. I think it's the same. The difference might be that we
could start with any positive integer if 1 doesn't work.
[...]
    On Wednesday, July 20, 2022, Peter Munn wrote:
 On Mon, July 18, 2022 2:45 am, Ali Sada via SeqFan wrote:
> Hi everyone,
> a(n) is the least positive integer not occurring earlier in the sequence
> such that, if a(m) = a(n)+1, then |m - n| = a(n).
> We start with a(1) = 1, then a(2) = 2. We move ahead and get a(4) = 3, and
> a(7) = 4. Now we go back to a(3) = 5 and that forces a(8) to be 6, etc.

I think you might be trying to create something like the inverse of the
sequence envisaged in the second comment in A078943?
[...]