A306779 Table read by rows: T(n,k) is the length of the longest non-intersecting loop starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n.

1, 2, 4, 3, 5, 9, 4, 8, 11, 16, 5, 9, 14, 19, 25, 6, 12, 18, 24, 29, 36, 7, 13, 19, 27, 33, 41

Offset: 1

Author

Peter Kagey, Mar 09 2019

Keywords

• tabl
• nonn
• more
• walk

Comments

Conjecture: T(n,k) = n*k if and only if k = 1 or gcd(n,k) > 1.

Examples

			Table begins:
  1;
  2,  4;
  3,  5,  9;
  4,  8, 11, 16;
  5,  9, 14, 19, 25;
  6, 12, 18, 24, 29, 36;
		

Crossrefs

Cf. A324604.