%I #24 Aug 21 2019 02:57:47
%S 0,0,0,0,1,2,5,6,8,10,13,16,21,25,28,31,39,42,48,54,61,66,73,79,88,93,
%T 98,110,120,125,136,144,157,166,172,181,195,201,211,224,242,248,258,
%U 274,286,298,309,320,341,348,359,379,393,403,416,433,455,466,478,495
%N a(n) is the number of pentagonal polyiamonds of all orders less than or equal to n.
%C Given the complete set of pentagonal polyiamonds and a tiling program, all possible pentagonal divisions of a space can be determined. The link section gives an example of the minimum and maximum number of pentagonal divisions of a space with a set of the four smallest pentagonal polyiamonds.
%C An example of tiling different spaces with a set of 46 different polyiamond tiles is given in the link section below. The idea here is to tile shapes that have a variety of different sides with two tile sets - one that has very few sides (pentagonal) and the other the maximum number of sides (unitary).
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a308/A308595.java">Java program</a> (github)
%H Craig Knecht, <a href="/A308595/a308595.png">Pentagonal polyiamond division of a triangle</a>
%H Craig Knecht, <a href="/A308595/a308595_1.png">Pentagonal and unitary polyiamond tiling</a>
%H Walter Trump, <a href="/A308595/a308595.pdf">Pentagonal polyiamonds</a>
%H Walter Trump, <a href="/A308595/a308595.txt">Simple program</a>
%K nonn
%O 0,6
%A _Craig Knecht_, Jun 09 2019