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.

A358716 a(n) is the number of inequivalent ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides.

Original entry on oeis.org

1, 2, 3, 12, 50, 711, 18031, 952013, 92323440
Offset: 1

Views

Author

Craig Knecht and John Mason, Nov 28 2022

Keywords

Comments

Similar to A358715, but now we do not regard dissections which differ by a rotation and/or reflection as distinct.

Examples

			a(3)=3 because of:
    /\      /\      /\
   /  \    /\/\    /\/\
  /    \  /  \/\  /\/\/\
		

Crossrefs