%I #10 Jun 02 2020 14:10:25

%S 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,26,24,25,

%T 27,28,29,30,32,31,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,

%U 50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67

%N Lexicographically earliest sequence of distinct positive terms whose Recamán transform has only distinct values.

%C The Recamán transform of a sequence {b(n), n>0} is the sequence {r(n), n>=0} defined as follows: r(0) = 0; for n > 0, r(n) = r(n-1) - b(n) if nonnegative and not already in the sequence, otherwise r(n) = r(n-1) + b(n).

%C The Recamán transform of this sequence corresponds to A118201.

%H Rémy Sigrist, <a href="/A335280/b335280.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A335280/a335280.png">Pinplot of (n, a(n)-n) for n = 1..100000</a>

%H Rémy Sigrist, <a href="/A335280/a335280.gp.txt">PARI program for A335280</a>

%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>

%F a(n) = abs(A118201(n)-A118201(n-1)).

%o (PARI) See Links section.

%Y Cf. A005132, A118201.

%K nonn

%O 1,2

%A _Rémy Sigrist_, May 30 2020