cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-8 of 8 results.

A197156 Number of free poly-[3^3.4^2]-tiles (polyhouses) (holes allowed) with n cells.

Original entry on oeis.org

1, 3, 5, 20, 56, 225, 819, 3333, 13336, 55231, 229146, 963284, 4068503, 17301000, 73893082, 317013121, 1364917667, 5896350458, 25545737979, 110968732581
Offset: 1

Views

Author

Joseph Myers, Oct 10 2011

Keywords

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

Cf. A197157, A197158.
Analogous for other tilings: A000105 (square), A000228 (hexagonal), A000577 (triangular), A197159 (floret pentagonal), A197459 (rhombille), A197462 (kisrhombille), A197465 (tetrakis square), A309159 (snub square), A343398 (trihexagonal), A343406 (truncated hexagonal), A343577 (truncated square).

Extensions

a(16)-a(20) from Bert Dobbelaere, Jun 02 2025

A197157 Number of one-sided poly-[3^3.4^2]-tiles (polyhouses) (holes allowed) with n cells.

Original entry on oeis.org

1, 4, 8, 34, 106, 430, 1616, 6594, 26588, 110188, 457964, 1925498, 8135692, 34597729, 147780810
Offset: 1

Views

Author

Joseph Myers, Oct 10 2011

Keywords

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

Cf. A197156, A197158.

A378344 Number of fixed site animals with n nodes on the nodes of the prismatic pentagonal tiling.

Original entry on oeis.org

3, 5, 12, 35, 106, 332, 1062, 3466, 11496, 38621, 131042, 448146, 1542548, 5338641, 18563680, 64814950, 227117365, 798387748, 2814618634
Offset: 1

Views

Author

Johann Peters, Nov 23 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
Dual to the polyhouses, AKA the site animals on the nodes of the elongated triangular tiling, counted by A197158, insofar as the tilings are each others' duals.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant c.
Terms a(1)-a(19) 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.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.

A378362 Number of fixed site animals containing n nodes on the nodes of the cairo pentagonal tiling.

Original entry on oeis.org

6, 10, 24, 68, 198, 594, 1816, 5650, 17824, 56836, 182788, 592060, 1929676, 6323418, 20819284, 68828316, 228372578, 760188362, 2537770576, 8494004948
Offset: 1

Views

Author

Johann Peters, Nov 23 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
Is dual to the polycairos counted by A196991, AKA site animals on the nodes of the snub square tiling, insofar that these tilings are each others' duals.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant c.
Terms a(1)-a(20) 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.

Examples

			There are six translationally distinct nodes in the cairo pentagonal tiling, so a(1)=6.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.

A378416 Number of fixed site animals with n nodes on the nodes of the rhombille tiling.

Original entry on oeis.org

3, 6, 21, 73, 273, 1049, 4117, 16416, 66263, 270211, 1111443, 4605575, 19204920, 80515734, 339137432, 1434319849
Offset: 1

Views

Author

Johann Peters, Nov 25 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
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.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant 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.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.

A379052 Number of fixed site animals with n nodes on the nodes of the floret pentagonal tiling.

Original entry on oeis.org

9, 15, 39, 124, 405, 1344, 4548, 15765, 55763, 199928, 723468, 2637378, 9677509, 35714337, 132445734, 493209254, 1843263534, 6910868397
Offset: 1

Views

Author

Johann Peters, Dec 17 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
Dual to the site animals on the nodes of the snub hexagonal tiling, counted by A197160, insofar as the tilings are each others' duals.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant c.
Terms a(1)-a(18) 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.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.

A379163 Number of fixed site animals with n nodes on the nodes of the tetrakis square tiling.

Original entry on oeis.org

2, 6, 26, 121, 597, 3040, 15876, 84520, 456584, 2494906, 13759902, 76475067, 427805198, 2406492158, 13602178244, 77206507977
Offset: 1

Views

Author

Johann Peters, Dec 17 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
Dual to the site animals on the nodes of the truncated square tiling, counted by A197467, insofar as the tilings are each others' duals.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n->oo} a(n+1)/a(n) converges to some growth constant 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.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.

Extensions

a(16) from Michael Bartmann, Jul 16 2025

A379178 Number of fixed site animals with n nodes on the nodes of the kisrhombille tiling.

Original entry on oeis.org

6, 18, 90, 479, 2718, 16126, 97885, 603741, 3771287, 23792622, 151342506, 969465873, 6248109573
Offset: 1

Views

Author

Johann Peters, Dec 17 2024

Keywords

Comments

Site animals on a lattice (regular graph) are connected induced subgraphs up to translation.
Dual to the site animals on the nodes of the truncated trihexagonal tiling, counted by A197464, insofar as the tilings are each others' duals.
The Madras reference gives a good treatment of site animals on general lattices.
It is a consequence of the Madras work that lim_{n\to\infty} a(n+1)/a(n) converges to some growth constant c.
Terms a(1)-a(13) 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.

Examples

			There are 6 translationally distinct sites in the kisrhombille lattice, so a(1)=6.

References

  • Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 2.7, 6.2 and 9.4.

Links

Crossrefs

The platonic tilings are associated with the following sequences: square A001168; triangular A001207; and hexagonal A001420.
The other 8 isogonal tilings are associated with these, A197160, A197158, A196991, A196992, A197461, A196993, A197464, A197467.

Formula

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.
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.