a(n) = smallest number of squares on a checkerboard that has exactly n domino tilings.

A060659

a(n) = smallest number of squares on a checkerboard that has exactly n domino tilings.

Terms

    a(0) =2a(1) =4a(2) =6a(3) =8a(4) =8a(5) =10a(6) =10a(7) =10a(8) =12a(9) =12a(10) =12a(11) =12a(12) =12a(13) =14a(14) =14a(15) =14a(16) =14a(17) =14a(18) =14a(19) =16a(20) =14a(21) =16a(22) =16a(23) =16a(24) =16a(25) =16a(26) =16a(27) =16a(28) =16a(29) =16

External references