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).

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).

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =1a(5) =4a(6) =7a(7) =3a(8) =3a(9) =7a(10) =3a(11) =6a(12) =1a(13) =6a(14) =3a(15) =8a(16) =10a(17) =4a(18) =4a(19) =10a(20) =8a(21) =14a(22) =5a(23) =8a(24) =1a(25) =8a(26) =5a(27) =14a(28) =21a(29) =11

External references