|
Search: id:A056640
|
|
|
| A056640 |
|
At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage. |
|
+0
3
|
|
| 1, 5, 18, 42, 83, 143, 228, 340, 485, 665, 886, 1150, 1463, 1827, 2248
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Number of unit squares at n-th stage = n^2 + (n-1)^2, A001844.
|
|
REFERENCES
|
Anthony Gardiner, "Mathematical Puzzling," Dover Publications, Inc., Mineola, NY., 1987, page 88.
|
|
FORMULA
|
G.f.: x(5x^2+2x+1)/[(1-x^2)(1-x)^3].
|
|
CROSSREFS
|
Sequence in context: A031428 A007742 A000338 this_sequence A101105 A037140 A007237
Adjacent sequences: A056637 A056638 A056639 this_sequence A056641 A056642 A056643
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 21 2000
|
|
|
Search completed in 0.002 seconds
|
