The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2

翻译：凸多联骨牌P的凸度定义为：使得P内任意两个格子可以通过至多k次方向改变的单调路径连接的最小整数k。本文提出一组公式与方程，作为C++程序的理论基础，该程序可计算迄今已知（按面积计）最长计数序列，对应凸度不超过2的凸多联骨牌。