A185290 Lexicographically least permutation of the integers in a triangle satisfying T(n,k) + T(n+1,k) <= T(n+1,k+1).

1, 2, 3, 4, 6, 9, 5, 10, 16, 25, 7, 12, 22, 38, 63, 8, 15, 27, 49, 87, 150, 11, 19, 34, 61, 110, 197, 347, 13, 24, 43, 77, 138, 248, 445, 792, 14, 28, 52, 95, 172, 310, 558, 1003, 1795, 17, 31, 59, 111, 206, 378, 688, 1246, 2249, 4044, 18, 35, 66, 125, 236, 442, 820, 1508, 2754, 5003, 9047, 20, 39, 74, 140, 265, 501, 943, 1763

Offset: 1

Author

Paul Tek, Apr 23 2013

Keywords

• nonn
• tabl

Comments

Apparently, T(n,k) ~ n*2^k as n grows.

Examples

			The first rows are:
[1]
[2,3]
[4,6,9]
[5,10,16,25]
For T(1,1), we choose the first integer not yet used: 1.
For T(2,1), we choose the first integer not yet used: 2.
For T(2,2), we choose the first integer >= T(1,1)+T(2,1) not yet used: 3.
For T(3,1), we choose the first integer not yet used: 4.
For T(3,2), we choose the first integer >= T(2,1)+T(3,1) not yet used: 6.
For T(3,3), we choose the first integer >= T(2,2)+T(3,2) not yet used: 9.
etc.
		

Links

• Paul Tek, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A035312.