The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049220 Number of horizontally convex n-ominoes in which the top row has at least 2 squares and the rightmost square in the top row is above the leftmost square in the second row. 3

%I

%S 0,0,1,3,9,28,89,285,914,2931,9397,30124,96565,309545,992266,3180775,

%T 10196193,32684604,104772769,335856389,1076610978,3451151243,

%U 11062904925,35462909836,113678819677,364405349233,1168126647770

%N Number of horizontally convex n-ominoes in which the top row has at least 2 squares and the rightmost square in the top row is above the leftmost square in the second row.

%H Dean Hickerson, <a href="http://www.cs.uwaterloo.ca/journals/JIS/HICK2/chcp.html">Counting Horizontally Convex Polyominoes</a>, J. Integer Sequences, Vol. 2 (1999), #99.1.8.

%F G.f.: x^3 (1-x)^2/(1-5x+7x^2-4x^3).

%F a(n) = 5a(n-1) - 7a(n-2) + 4a(n-3) for n >= 6.

%F a(n) = a(n-1) + A001169(n-2) for n >= 3.

%t a[ n_ ] := a[ n ]=If[ n<6, {0, 0, 1, 3, 9}[ [ n ] ], 5a[ n-1 ]-7a[ n-2 ]+4a[ n-3 ] ]

%Y Cf. A001169.

%K nonn,easy

%O 1,4

%A _Dean Hickerson_, Aug 10 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 12:40 EDT 2021. Contains 347477 sequences. (Running on oeis4.)