Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 17 2024 11:18:16
%S 3,6,21,73,273,1049,4117,16416,66263,270211,1111443,4605575,19204920,
%T 80515734,339137432,1434319849
%N Number of fixed site animals with n nodes on the nodes of the rhombille tiling.
%C Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
%C Dual to the site animals on the nodes of the trihexagonal (AKA kagome) tiling, counted by A197461, insofar as the tilings are each others' duals.
%C The Madras reference gives a good treatment of site animals on general lattices.
%C It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant c.
%C Terms a(1)-a(16) were found by running a generalization of Redelmeier's algorithm. The transfer matrix algorithm (TMA) is more efficient than Redelmeier's for calculating regular polyominoes, and may give more terms here too. See the Jensen reference for a treatment of the TMA. See the Vöge and Guttman reference for an implementation of the TMA on the triangular lattice to count polyhexes, A001207.
%D Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.
%H Anthony J. Guttman (Ed.), <a href="https://link.springer.com/book/10.1007/978-1-4020-9927-4t">Polygons, Polyominoes, and Polycubes</a>. Canopus Academic Publishing Limited, Bristol, 2009.
%H Iwan Jensen, <a href="https://link.springer.com/article/10.1023/A:1004855020556">Enumerations of Lattice Animals and Trees</a>, Journal of Statistical Physics 102 (2001), 865-881.
%H N. Madras, <a href="https://link.springer.com/article/10.1007/BF01608793">A pattern theorem for lattice clusters</a>A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
%H N. Madras and G. Slade, <a href="https://link.springer.com/book/10.1007/978-1-4614-6025-1">The Self-Avoiding Walk</a>. Birkhäuser Publishing (1996).
%H D. Hugh Redelmeier, <a href="https://www.sciencedirect.com/science/article/pii/0012365X81902375">Counting Polyominoes: Yet Another Attack</a>, Discrete Mathematics 36 (1981), 191-203.
%H Markus Vöge and Anthony J. Guttman, <a href="https://www.sciencedirect.com/science/article/pii/S0304397503002299">On the number of hexagonal polyominoes</a>. Theoretical Computer Science, 307 (2003), 433-453.
%F It is widely believed site animals on 2-dimensional lattices grow asymptotically to kc^n/n, where k is a constant and c is the growth constant, dependent only on the lattice. See the Madras and Slade reference.
%Y The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
%Y The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.
%K nonn,hard,more,new
%O 1,1
%A _Johann Peters_, Nov 25 2024