%I A074764
%S A074764 1,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,
%T A074764 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,
%U A074764 52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74
%N A074764 Numbers of smaller squares into which a square may be dissected.
%C A074764 All even n>2 are present by generalizing this corner+border construction, 
               all odd n>5 are present because n+3 can be obtained from n by splitting 
               any single square into four, 1 is trivially present and n=2, 3 & 
               5 are then fairly easily eliminated.
%C A074764 Also number of smaller similar triangles into which a triangle may be 
               dissected. - Lekraj Beedassy (blekraj(AT)yahoo.com), Nov 25 2003
%D A074764 A. Soifer, How Does One Cut A Triangle?, Chapter 2, CEME, Colorado Springs 
               CO 1990.
%D A074764 Allan C. Wechsler and Michael Kleber, messages to math-fun mailing list, 
               Sep 06, 2002.
%F A074764 n # 2, 3 or 5. G.f.(x) = x*(1-x+x^3-x^4+x^5)/(1-x)
%e A074764 6 is a member of the sequence because:
%e A074764 +---+---+---+
%e A074764 |...|...|...|
%e A074764 +---+---+---+
%e A074764 |.......|...|
%e A074764 |.......+---+
%e A074764 |.......|...|
%e A074764 +-------+---+
%Y A074764 Sequence in context: A005670 A123860 A122817 this_sequence A101087 A138887 
               A031949
%Y A074764 Adjacent sequences: A074761 A074762 A074763 this_sequence A074765 A074766 
               A074767
%K A074764 easy,nonn
%O A074764 1,2
%A A074764 Marc LeBrun (mlb(AT)well.com), Sep 06 2002