login
a(1) = 4; a(2) = 3; a(3) = 1; for n > 3, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).
1

%I #10 Apr 04 2014 01:37:00

%S 4,3,1,4,8,13,7,14,6,15,5,16,28,41,27,12,28,11,29,10,30,9,31,54,78,53,

%T 79,52,24,53,23,54,22,55,21,56,20,57,19,58,18,59,17,60,104,149,103,

%U 150,102,151,101,50,102,49,103,48,104,47,105,46,106,45,107,44,108,43,109

%N a(1) = 4; a(2) = 3; a(3) = 1; for n > 3, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).

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

%Y A variant of A005132. A row of the array in A066202.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_, Dec 16 2001

%E More terms from _Vladeta Jovovic_, Dec 16 2001