|
%I #9 Apr 17 2016 09:32:26
%S 0,1,1,2,5,20,56,276,2136,13756,148352,2727448,41044816,1056334024,
%T 46033137324
%N Number of ways to trisect a triangle with side length n exactly into three identical parts in a triangular lattice.
%C In the case that n is not divisible by 3 the central triangle is removed, otherwise the dissection would not be possible.
%H G. P. Jelliss, <a href="http://www.mayhematics.com/j/gpj22.htm#(2)">Trisected Triangles</a>, The Games and Puzzles Journal, Issue 22, January-April 2002.
%Y Cf. A268606, A271857, A113900, A257952.
%K nonn,more
%O 1,4
%A _Andrew Howroyd_, Apr 15 2016
|
