cp's OEIS Frontend

A066202 Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).

%I A066202 #12 Feb 18 2018 02:50:16
%S A066202 1,2,2,4,1,4,7,3,3,7,3,6,1,6,3,8,10,4,4,10,8,14,5,8,1,8,5,14,21,11,13,
%T A066202 5,5,13,11,21,13,4,7,10,1,10,7,4,13,22,12,14,16,6,6,16,14,12,22,12,21,
%U A066202 6,9,12,1,12,9,6,21,12,23,31,15,17,19,7,7,19,17,15,31,23,11,20,5,8,11,14,1
%N A066202 Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).
%H A066202 <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%e A066202 Array begins
%e A066202 1 2 4 7 3 8 ...
%e A066202 2 1 3 6 10 5 ...
%e A066202 4 3 1 4 8 13 ...
%e A066202 7 6 4 1 5 10 ...
%t A066202 T[n_, n_] = 1; T[n_, k_] /; k < n := T[n, k] = T[k, n]; T[n_, k_] := T[n, k] = If[t = T[n, k - 1] - (k - 1); t > 0 && FreeQ[Table[T[n, j], {j, 1, k - 1}], t], t, T[n, k - 1] + (k - 1)]; Table[T[n - k + 1, k], {n, 1, 13}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Feb 18 2018 *)
%Y A066202 Rows give A063733, A066203, A066204. Cf. A066201 for another version.
%K A066202 nonn,easy,tabl
%O A066202 1,2
%A A066202 _N. J. A. Sloane_, Dec 16 2001
%E A066202 More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003