|
Search: id:A049219
|
|
|
| A049219 |
|
Number of horizontally convex n-ominoes in which the top row has exactly 1 square. |
|
+0
3
|
|
| 1, 1, 3, 10, 33, 107, 344, 1103, 3535, 11330, 36317, 116415, 373176, 1196243, 3834643, 12292218, 39403561, 126310851, 404898200, 1297929287, 4160602439, 13337099986, 42753000005, 137047709879, 439315949304, 1408257777387
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Dean Hickerson, Counting Horizontally Convex Polyominoes, J. Integer Sequences, Vol. 2 (1999), #99.1.8.
|
|
LINKS
|
Hickerson reference.
|
|
FORMULA
|
G.f.: x (1-x)^2 (1-2x)/(1-5x+7x^2-4x^3)
a(n) = 5a(n-1) - 7a(n-2) + 4a(n-3) for n >= 5
|
|
MATHEMATICA
|
a[ n_ ] := a[ n ]=If[ n<5, {1, 1, 3, 10}[ [ n ] ], 5a[ n-1 ]-7a[ n-2 ]+4a[ n-3 ] ]
|
|
CROSSREFS
|
a(n) = A001169(n-1) + A049221(n) for n >= 2
Adjacent sequences: A049216 A049217 A049218 this_sequence A049220 A049221 A049222
Sequence in context: A053156 A120897 A077825 this_sequence A126184 A060557 A018920
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Dean Hickerson (dean(AT)math.ucdavis.edu), Aug 10 1999
|
|
|
Search completed in 0.002 seconds
|
