A308300 T(n,k) is the number of simply connected square animals with n cells and k internal vertices (0 <= k <= A083479(n)), triangle read by rows.
1, 1, 2, 4, 1, 11, 1, 27, 7, 1, 82, 21, 4, 250, 90, 21, 2, 815, 334, 89, 9, 1, 2685, 1311, 391, 67, 6, 9072, 4978, 1674, 324, 45, 1, 30889, 19030, 7089, 1630, 275, 23, 1, 106290, 72082, 29433, 7629, 1498, 174, 11
Offset: 1
Examples
The table starts: 1; 1; 2; 4, 1; 11, 1; 27, 7, 1; 82, 21, 4; 250, 90, 21, 2; 815, 334, 89, 9, 1; 2685, 1311, 391, 67, 6; 9072, 4978, 1674, 324, 45, 1; 30889, 19030, 7089, 1630, 275, 23, 1; 106290, 72082, 29433, 7629, 1498, 174, 11; ...
Links
- John Mason, Table of n, a(n) for n = 1..95, rows 1..18
- Elena V. Konstantinova, The constructive enumeration of square animals, POSTECH 10 (2000).
- Elena V. Konstantinova and Maxim V. Vidyuk, Discriminating tests of information and topological indices. Animals and trees, J. Chem. Inf. Comput. Sci. 43 (2003), 1860-1871, Table 2.