7
Description
OEIS sequence A096004 gives the
Number of convex triangular polyominoes [polyiamonds] containing n cells.
It begins:
1, 1, 1, 2, 1, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 5
For example, a(8)=3 with the following three convex polyiamonds:
Input: 8
Output:
*---*---*---*---*
/ \ / \ / \ / \ /
*---*---*---*---*
*---*---*
/ \ / \ /
*---*---*
/ \ / \ /
*---*---*
*---*
/ \ / \
*---*---*
/ \ / \ / \
*---*---*---*
Requirements
The goal of this challenge is to write a program that takes in an integer n (in any reasonable format) and outputs ASCII art of all convex polyiamonds with n cells (in any orientation), with each polyiamond separated by two newlines.
Your program must be able to handle up to a(30) in under 60 seconds.
Scoring
This is a code-golf challenge, so fewest bytes wins.
A Wumpus answer to this one would be great!
– sundar - Reinstate Monica – 2018-07-16T20:19:18.49360 seconds on which machine.... – user202729 – 2018-07-17T04:08:56.220
1On whichever machine—I trust people to be reasonable. – Peter Kagey – 2018-07-17T05:29:08.540
And this will happen... – user202729 – 2018-07-17T06:06:18.387
You should specify that the polyiamonds are considered the same under rotation and reflection. – user202729 – 2018-07-17T06:53:27.790
2I'd seriously consider removing the time restriction. I don't see what it adds to the challenge other than ambiguity. – Post Rock Garf Hunter – 2018-07-17T18:38:06.493