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.

A268606 Number of ways to trisect a hexagon with side length n exactly into three identical parts in a triangular lattice.

Original entry on oeis.org

1, 5, 116, 15785, 11599297, 47212453928, 1100377983366327, 148568527921382084692
Offset: 1

Views

Author

Luca Petrone, Feb 08 2016

Keywords

Links

Crossrefs

Cf. A257952, A271741, A271857.

Extensions

Added a(6) from Jelliss's website by Vaclav Kotesovec, Mar 03 2016
a(7)-a(8) from Andrew Howroyd, Apr 11 2016

A271741 Number of ways to dissect a hexagon with side length n exactly into two identical parts in a triangular lattice.

Original entry on oeis.org

1, 8, 731, 982648, 16305532683, 3722056510716702, 11931439930135002524767
Offset: 1

Views

Author

Andrew Howroyd, Apr 15 2016

Keywords

Links

  • G. P. Jelliss, Dissected Hexagons, The Games and Puzzles Journal, Issue 22, January-April 2002.

Crossrefs

Cf. A268606, A271857, A113900.

A271858 Number of ways to trisect a triangle with side length n exactly into three identical parts in a triangular lattice.

Original entry on oeis.org

0, 1, 1, 2, 5, 20, 56, 276, 2136, 13756, 148352, 2727448, 41044816, 1056334024, 46033137324
Offset: 1

Views

Author

Andrew Howroyd, Apr 15 2016

Keywords

Comments

In the case that n is not divisible by 3 the central triangle is removed, otherwise the dissection would not be possible.

Links

  • G. P. Jelliss, Trisected Triangles, The Games and Puzzles Journal, Issue 22, January-April 2002.

Crossrefs

Cf. A268606, A271857, A113900, A257952.
Showing 1-3 of 3 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.