|
Search: id:A045846
|
|
|
| A045846 |
|
Number of ways to cut an n X n square into squares with integer sides. |
|
+0
1
|
|
| 1, 2, 6, 40, 472, 10668, 450924, 35863972, 5353011036, 1500957422222, 790347882174804, 781621363452405930, 1451740730942350766748
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
It appears lim n->infinity a(n)*a(n-3)/(a(n-1)*a(n-2)) = 3.527... - Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), May 03 2005
|
|
EXAMPLE
|
For n=3 the 6 dissections are: the full 3 X 3 square; 9 1 X 1 squares; one 2 X 2 square and five 1 X 1 squares (in 4 ways).
|
|
CROSSREFS
|
Sequence in context: A098852 A120592 A081471 this_sequence A135755 A051185 A118623
Adjacent sequences: A045843 A045844 A045845 this_sequence A045847 A045848 A045849
|
|
KEYWORD
|
hard,nonn,nice
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
EXTENSIONS
|
More terms from Hugo van der Sanden (hv(AT)crypt.org), Nov 06 2000
|
|
|
Search completed in 0.002 seconds
|
