Counting horizontally convex polyominoes

Journal of Integer Sequences

Volumn 2, Issue 2, 1999, Pages

  Hickerson, Dean ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER SEQUENCES; LINEAR RECURRENCE; POLYMINOES;

APPROXIMATION THEORY; FUNCTIONS; NUMBER THEORY; PROBLEM SOLVING; THEOREM PROVING;

INTEGER PROGRAMMING;

EID: 3442886334     PISSN: 15307638     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. [EIS] The On-Line Encyclopedia of Integer Sequences, by Neil Sloane, http://www.research.att.com/~njas/sequences/eisonline.html
2. [K0] David A. Klarner, "Some results concerning polyominoes", Fibonacci Quarterly, 3 (1965) 9-20.
3. [K1] David A. Klarner, "Cell growth problems", Canad. J. Math., 19 (1967) 851-863.
4. [P] G. Pólya, "On the number of certain lattice polygons", J. Comb. Theory, 6 (1969) 102-105.
5. [S0] Richard P. Stanley, "Generating functions", in Studies in Combinatorics, edited by Gian-Carlo Rota, MAA Studies in Mathematics, vol. 17 (1978), pp. 100-141.
6. [S1] Richard P. Stanley, Enumerative Combinatorics, vol. 1, Cambridge Studies in Advanced Mathematics #49, Cambridge University Press, 1997.
7. [T] H. N. V. Temperley, "Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules", Physical Review, ser. 2, 103 (1956) 1-16.