A185908 Array: T(n,k) = n-1 + min{n,k}, by antidiagonals.

1, 1, 2, 1, 3, 3, 1, 3, 4, 4, 1, 3, 5, 5, 5, 1, 3, 5, 6, 6, 6, 1, 3, 5, 7, 7, 7, 7, 1, 3, 5, 7, 8, 8, 8, 8, 1, 3, 5, 7, 9, 9, 9, 9, 9, 1, 3, 5, 7, 9, 10, 10, 10, 10, 10, 1, 3, 5, 7, 9, 11, 11, 11, 11, 11, 11, 1, 3, 5, 7, 9, 11, 12, 12, 12, 12, 12, 12, 1, 3, 5, 7, 9, 11, 13, 13, 13, 13, 13, 13, 13, 1, 3, 5, 7, 9, 11, 13, 14, 14, 14, 14, 14, 14, 14, 1, 3, 5, 7, 9, 11, 13, 15, 15, 15, 15, 15, 15, 15, 15, 1, 3, 5, 7, 9, 11, 13, 15, 16, 16, 16, 16, 16, 16, 16, 16, 1, 3, 5, 7, 9, 11, 13, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 3, 5, 7, 9, 11, 13, 15, 17

Offset: 1

Author

Clark Kimberling, Feb 06 2011

Keywords

• nonn
• tabl

Comments

A member of the accumulation chain ... < A185907 < A185908 < A185909 < ...

(See A144112 for definitions of weight array and accumulation array.)

Examples

			Northwest corner:
  1, 1, 1, 1, 1
  2, 3, 3, 3, 3
  3, 4, 5, 5, 5
  4, 5, 6, 7, 7
		

Links

• G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Crossrefs

Cf. A144112, A185907, A185909.

Programs

Mathematica

(See A185907.)

Formula

T(n,k) = n-1 + min{n,k}, k >= 1, n >= 1.