OFFSET
1,2
COMMENTS
LINKS
FORMULA
Triangle T(n, k), 1<=k<=n, read by rows, defined by: T(n, k) = 0 for n<k and T(n, k) = A002620(n-k+1) + k*n + k - n if n>=k. T(n, n) = n^2; T(n, 1) = 1 + A002620(n) = A033638(n). - Philippe Deléham, Feb 16 2004
Square: t(n,k) = (n-1)(n+k) + k^2/4 + (1/8)(7+(-1)^k). - Clark Kimberling, Aug 08 2013
EXAMPLE
As a square array, a northwest corner:
1 ... 2 ... 3 ... 5 ... 7 ... 10
4 ... 6 ... 8 ... 11 .. 14 .. 18
9 ... 12 .. 15 .. 19 .. 23 .. 28
16 .. 20 .. 24 .. 29 .. 34 .. 40
25 .. 30 .. 35 .. 41 .. 47 .. 54
36 .. 42 .. 48 .. 55 .. 62 .. 70
49 .. 56 .. 63 .. 71 .. 79 .. 88
64 .. 72 .. 80 .. 89 .. 98 .. 108
- Clark Kimberling, Aug 08 2013
MATHEMATICA
(* Program generates the dispersion array T of the increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12; f[n_] := n+Floor[1/2+Sqrt[n]] (* complement of column 1 *); mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]; rows = {NestList[f, 1, c]}; Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}]; t[i_, j_] := rows[[i, j]]; TableForm[Table[t[i, j], {i, 1, r1}, {j, 1, c1}]] (* A056537 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A056537 sequence *)
(* Clark Kimberling, Jun 06 2011 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Antti Karttunen, Jun 20 2000
STATUS
approved