1,2

a(n) >= n, since the rightmost squares in each row must be covered by distinct tiles.

a(n) = n iff n = 2^k - 1.

a(n) = n+1 iff n = 2^k - 2^m - 1.

Table of n, a(n) for n=1..27.

Canadian Mathematical Society, 2010 Canadian Mathematical Olympiad, Problem 1

C. Zhang, Diagrams of tilings

See link for diagrams of tilings.

Solutions for a(n) = n: A000225. Solutions for a(n) = n+1: A030130, excluding 0.

Sequence in context: A200690 A045773 A256700 * A222405 A146970 A078708

Adjacent sequences: A175036 A175037 A175038 * A175040 A175041 A175042

nonn

Cyril Zhang, Apr 04 2010

approved