login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066201 Array read by antidiagonals: for n-th row (n>=0), T(n,0) = 1; for k > 0, T(n,k) = T(n,k-1)-(n+k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(n+k-1). 5

%I

%S 1,1,1,1,2,2,1,3,4,4,1,4,6,7,7,1,5,8,2,3,3,1,6,10,3,7,8,8,1,7,12,4,9,

%T 13,14,14,1,8,14,5,11,2,20,21,21,1,9,16,6,13,3,10,12,13,13,1,10,18,7,

%U 15,4,12,19,21,22,22,1,11,20,8,17,5,14,2,29,11,12,12,1,12,22,9,19,6,16,3,13

%N Array read by antidiagonals: for n-th row (n>=0), T(n,0) = 1; for k > 0, T(n,k) = T(n,k-1)-(n+k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(n+k-1).

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

%e Array begins

%e 1 1 2 4 7 3 8 ...

%e 1 2 4 7 3 8 14 ...

%e 1 3 6 2 7 13 20 ...

%e 1 4 8 3 9 2 10 ...

%t T[_, 0] = 1; T[n_, k_] := T[n, k] = If[t = T[n, k-1] - (n+k-1); t > 0 && FreeQ[Table[T[n, j], {j, 0, k-1}], t], t, T[n, k-1] + (n+k-1)]; Table[ T[n-k, k], {n, 0, 12}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Feb 18 2018 *)

%Y Rows give A063733, A063733, A005132, A066199, A066200.

%K nonn,easy,tabl

%O 1,5

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

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 05 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 19:25 EST 2018. Contains 317149 sequences. (Running on oeis4.)