Johann Peters - cp's OEIS frontend

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

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

Offset: 1

Johann Peters, Dec 17 2024

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.

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

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes, Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk, Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes. Theoretical Computer Science, 307 (2003), 433-453.

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.

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

Johann Peters, Dec 17 2024

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.

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes, Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk, Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes, Theoretical Computer Science, 307 (2003), 433-453.

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.

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.

a(16) from Michael Bartmann, Jul 16 2025

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

Johann Peters, Dec 17 2024

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.

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes, Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk, Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes, Theoretical Computer Science, 307 (2003), 433-453.

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.

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

Johann Peters, Nov 25 2024

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.

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes. Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clustersA pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk. Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes. Theoretical Computer Science, 307 (2003), 433-453.

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.

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

Johann Peters, Nov 23 2024

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.

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

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes, Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk, Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes, Theoretical Computer Science, 307 (2003), 433-453.

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.

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.

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

Johann Peters, Nov 23 2024

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.

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

Anthony J. Guttman (Ed.), Polygons, Polyominoes, and Polycubes. Canopus Academic Publishing Limited, Bristol, 2009.
Iwan Jensen, Enumerations of Lattice Animals and Trees, Journal of Statistical Physics 102 (2001), 865-881.
N. Madras, A pattern theorem for lattice clusters, Annals of Combinatorics, 3 (1999), 357-384.
N. Madras and G. Slade, The Self-Avoiding Walk. Birkhäuser Publishing (1996).
D. Hugh Redelmeier, Counting Polyominoes: Yet Another Attack, Discrete Mathematics 36 (1981), 191-203.
Markus Vöge and Anthony J. Guttman, On the number of hexagonal polyominoes. Theoretical Computer Science, 307 (2003), 433-453.

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.

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.

A374397 a(n) is the number of 4-step self avoiding walks in the n-dimensional hypercubic lattice that start at the origin.

Original entry on oeis.org

2, 100, 726, 2696, 7210, 15852, 30590, 53776, 88146, 136820, 203302, 291480, 405626, 550396, 730830, 952352, 1220770, 1542276, 1923446, 2371240, 2893002, 3496460, 4189726, 4981296, 5880050, 6895252, 8036550, 9313976, 10737946, 12319260, 14069102, 15999040, 18121026

Offset: 1

Johann Peters, Jul 07 2024

We have the formula below because we have 2*n choices for the first step, and (2*n-1)^3 choices for the next three, but have counted exactly 2*n*(2*n-1)*(2*n-2) self-intersecting walks.

N. Madras and G. Slade, "The Self Avoiding Walk", Birkhäuser, 2013.

Paolo Xausa, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A010575.

A374397[n_] := 2*n*(4*n*(n - 1)*(2*n - 1) + 1);
Array[A374397, 50] (* or *)
LinearRecurrence[{5, -10, 10, -5, 1}, {2, 100, 726, 2696, 7210}, 50] (* Paolo Xausa, Sep 23 2024 *)

a(n) = 16*n^4 - 24*n^3 + 8*n^2 + 2*n.

G.f.: 2*x*(1 + 45*x + 123*x^2 + 23*x^3)/(1 - x)^5. - Stefano Spezia, Jul 07 2024

A367557 The number of fixed kissing polyominoes with n cells.

Original entry on oeis.org

4, 40, 260, 1428, 7184, 34238, 157398, 705518, 3104394, 13469766, 57811669, 245990766

Offset: 7

Johann Peters, Nov 22 2023

Translations are allowed, but not rotations or reflections.
A polyomino is 'kissing' if there exist two cells that touch only at a corner such that no cell exists touching both edgewise simultaneously.
First thirteen terms calculated by filtering the output of Redelmeier's Algorithm.

			The smallest kissing polyomino has area 7; its four rotations determine the first term in the sequence:
    OOO
    O O
    OO

Alain Goupil, Marie-Eve Pellerin, and Jérôme de Wouters d'Oplinter, Partially Directed Snake Polyominoes, Discrete Applied Mathematics, Volume 236, 2018.

Cf. A182644, A376496.

a(14)-a(18) from John Mason, Sep 25 2024

A367253 The number of ways of making change for 5n cents with Canadian coins (5, 10, 25, 100, 200).

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 18, 20, 22, 24, 26, 30, 32, 36, 38, 42, 46, 50, 54, 58, 62, 68, 72, 78, 82, 88, 94, 100, 106, 112, 118, 128, 134, 144, 150, 160, 170, 180, 190, 200, 210, 224, 234, 248, 258, 272, 286, 300, 314, 328, 342, 362

Offset: 0

Johann Peters, Nov 11 2023

Since 2012 the Canadian penny has been discontinued. The coins now commonly used are the nickel (5 cents), the dime (10 cents), the quarter (25 cents), the loonie (100 cents), and the toonie (200 cents).

Number of partitions of n into parts 1, 2, 5, 20, 40. - Alois P. Heinz, Nov 11 2023

Ray Chandler, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1, 1, -1, 0, 1, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, 0, -1, 1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, 0, -1, 1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 1, -1, 0, 1, -1, -1, 1).
Index entries for sequences related to making change.

Cf. A000008, A001312, A182086, A307849.

a[n_]:=Length[FrobeniusSolve[{5,10,25,100,200},5*n]]; a/@Range[0,100] (* Ivan N. Ianakiev, Nov 21 2023 *)
CoefficientList[Series[1/((1-x)*(1-x^2)*(1-x^5)*(1-x^20)*(1-x^40)),{x,0,1000}],x] (* Ray Chandler, Nov 22 2023 *)

From Alois P. Heinz, Nov 11 2023: (Start)
G.f.: 1/((1-x)*(1-x^2)*(1-x^5)*(1-x^20)*(1-x^40)).
a(20*n) = A307849(n). (End)

cp's OEIS Frontend

User: Johann Peters

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

Extensions

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

A374397 a(n) is the number of 4-step self avoiding walks in the n-dimensional hypercubic lattice that start at the origin.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A367557 The number of fixed kissing polyominoes with n cells.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A367253 The number of ways of making change for 5n cents with Canadian coins (5, 10, 25, 100, 200).