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.

This page as a plain text file.
%I A358716 #11 Dec 06 2022 10:00:41
%S A358716 1,2,3,12,50,711,18031,952013,92323440
%N 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.
%C A358716 Similar to A358715, but now we do not regard dissections which differ by a rotation and/or reflection as distinct.
%e A358716 a(3)=3 because of:
%e A358716     /\      /\      /\
%e A358716    /  \    /\/\    /\/\
%e A358716   /    \  /  \/\  /\/\/\
%Y A358716 Cf. A224239, A358715.
%Y A358716 Cf. A299705.
%K A358716 nonn,more
%O A358716 1,2
%A A358716 _Craig Knecht_ and _John Mason_, Nov 28 2022