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-3 of 3 results.

A167254 Number of ways to partition an n X 6 grid into 6 connected equal-area regions.

Original entry on oeis.org

1, 13, 170, 2003, 27950, 451206, 6633399, 99697633, 1418159011
Offset: 1

Views

Author

R. H. Hardin Oct 31 2009

Keywords

Examples

			Some solutions for n=4
...1.1.2.2.2.3...1.1.1.1.2.3...1.2.2.2.2.3...1.1.2.2.2.3...1.1.1.2.2.2
...1.4.4.2.3.3...4.4.2.2.2.3...1.1.1.3.3.3...1.1.2.4.4.3...1.3.3.3.3.2
...1.4.4.5.5.3...5.4.4.6.6.3...4.5.5.5.6.6...5.6.6.6.4.3...4.4.5.5.6.6
...6.6.6.6.5.5...5.5.5.6.6.3...4.4.4.5.6.6...5.5.5.6.4.3...4.4.5.5.6.6
------
...1.1.1.2.3.3...1.2.3.3.3.3...1.1.2.2.2.2...1.2.3.4.4.5...1.1.1.1.2.2
...1.2.2.2.3.3...1.2.2.2.4.4...3.1.4.5.5.5...1.2.3.4.5.5...3.3.3.3.2.4
...4.4.5.5.5.5...1.5.5.6.4.4...3.1.4.4.6.5...1.2.3.4.6.5...5.6.6.6.2.4
...4.4.6.6.6.6...1.5.5.6.6.6...3.3.4.6.6.6...1.2.3.6.6.6...5.5.5.6.4.4
------
...1.1.2.2.2.3...1.1.2.3.3.4...1.2.2.3.3.3...1.1.2.3.3.3...1.1.2.2.2.3
...1.4.2.5.5.3...1.2.2.2.3.4...1.2.2.3.4.5...1.4.2.5.5.3...1.1.2.3.3.3
...1.4.5.5.6.3...1.5.5.6.3.4...1.6.4.4.4.5...1.4.2.5.6.6...4.4.4.5.5.5
...4.4.6.6.6.3...5.5.6.6.6.4...1.6.6.6.5.5...4.4.2.5.6.6...4.6.6.6.6.5
		

Formula

a(n) = A167262(n,6). - R. J. Mathar, Oct 13 2024

A167245 Number of ways to partition a 2*n X 3 grid into 6 connected equal-area regions.

Original entry on oeis.org

1, 11, 170, 997, 7670, 62609, 296063, 1685893, 9684421, 41633825
Offset: 1

Views

Author

R. H. Hardin, Oct 31 2009

Keywords

Examples

			Some solutions for n=4
...1.1.2...1.1.1...1.1.2...1.1.2...1.1.1...1.2.2...1.2.2...1.2.2...1.1.1
...1.2.2...2.1.3...3.1.2...1.2.2...2.3.1...1.2.2...1.1.2...1.2.2...2.1.3
...1.3.2...2.3.3...3.1.2...1.2.3...2.3.3...1.3.3...1.3.2...1.3.3...2.3.3
...3.3.4...2.2.3...3.4.2...4.3.3...2.3.4...1.3.3...3.3.4...1.3.3...2.4.3
...3.4.4...4.4.4...3.4.4...4.4.3...2.4.4...4.4.4...5.3.4...4.4.4...2.4.4
...5.4.6...5.4.6...5.5.4...5.4.6...5.4.6...4.5.5...5.6.4...4.5.5...5.4.6
...5.5.6...5.5.6...6.5.5...5.6.6...5.5.6...6.5.5...5.6.4...6.6.5...5.5.6
...5.6.6...5.6.6...6.6.6...5.5.6...5.6.6...6.6.6...5.6.6...6.6.5...5.6.6
		

Crossrefs

Cf. A167262.

Formula

a(n) = A167262(2n,3). - R. J. Mathar, Oct 13 2024

A167249 Number of ways to partition a 3*n X 4 grid into 6 connected equal-area regions.

Original entry on oeis.org

11, 2003, 244252, 22351172, 1403637121
Offset: 1

Views

Author

R. H. Hardin Oct 31 2009

Keywords

Examples

			Some solutions for n=3
...1.1.1.2...1.1.1.2...1.1.1.2...1.1.1.2...1.1.1.2...1.1.1.2...1.1.1.2
...1.1.2.2...1.1.2.2...1.1.2.2...1.1.2.2...1.1.2.2...1.1.2.2...1.1.2.2
...1.3.2.2...1.3.2.2...1.3.2.2...1.3.2.2...1.3.2.2...1.3.2.2...1.3.2.2
...4.3.3.2...3.3.3.2...3.3.3.2...3.3.3.2...3.3.3.2...3.3.3.2...3.3.3.2
...4.3.3.5...4.3.3.5...4.3.5.5...3.3.4.4...3.3.4.4...4.3.3.5...3.3.4.4
...4.6.3.5...4.6.6.5...4.3.5.5...4.4.4.4...5.4.4.4...4.6.5.5...5.5.5.4
...4.6.5.5...4.4.6.5...4.6.6.5...5.6.6.6...5.6.6.4...4.6.6.5...5.6.6.4
...4.6.5.5...4.6.6.5...4.6.6.5...5.6.6.6...5.6.6.6...4.6.6.5...5.6.4.4
...4.6.6.6...4.6.5.5...4.4.6.6...5.5.5.5...5.5.5.6...4.4.6.5...5.6.6.6
		

Formula

a(n) = A167262(3n,4). - R. J. Mathar, Oct 13 2024
Showing 1-3 of 3 results.