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.
%I A337415 #18 Sep 08 2020 03:38:05 %S A337415 1,0,1,3,11,314 %N A337415 a(n) is the number of ways to tile a size n triangle in the triangular grid with n n-cell polyiamonds, up to rotation and reflection of the triangle. %C A337415 The initial values are computed via the program from _Arnauld Chevallier_ in the Code Golf Stack Exchange link. %H A337415 Code Golf Stack Exchange, <a href="https://codegolf.stackexchange.com/q/210111/53884">Cut a triangle into equal-sized parts!</a> %H A337415 Peter Kagey, <a href="/A337415/a337415.pdf">Example of the a(5) = 11 partitions of the size 5 triangle into five 5-iamonds</a>. %e A337415 An example of the a(4) = 3 essentially different ways of tiling a size 4 triangle with 4-iamonds can be found via the Code Golf Stack Exchange link. %Y A337415 A328020 is the analog for square on the square grid. %Y A337415 Cf. A000577. %K A337415 nonn,more,hard %O A337415 1,4 %A A337415 _Peter Kagey_ and _Alec Jones_, Aug 26 2020