|
Search: id:A096004
|
|
|
| A096004 |
|
Number of convex triangular polyominoes containing n cells. |
|
+0
1
|
|
| 1, 1, 1, 2, 1, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 5, 2, 3, 3, 4, 2, 4, 4, 6, 3, 3, 4, 5, 2, 5, 5, 7, 3, 4, 5, 6, 3, 5, 5, 8, 3, 4, 5, 6, 4, 7, 7, 9, 4, 5, 5, 7, 3, 7, 8, 9, 3, 5, 7, 8, 4, 8, 8, 11, 4, 5, 7, 8, 4, 9, 9, 11, 5, 5, 8, 9, 4, 9, 9, 13, 5, 7, 8, 9, 5, 8, 9, 12
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The main sequence on triangular polyominoes is A000577. The convexity condition makes enumeration easy as a convex triangular polyomino has at most 6 sides. It is simple to prove that a(n) is also the number of 4-tuples (p,b,c,d) of nonnegative integers satisfying b<=c<=d, b+c+d<=p, n=p^2-b^2-c^2-d^2.
|
|
MAPLE
|
a:=proc(n) local x, p, d, c, b; x:=0; for p from 0 to ceil((n+1)/2) do; for d from 0 to p do; for c from 0 to min(d, p-d) do; for b from 0 to min(c, p-c-d) do; if p^2-b^2-c^c-d^2=n then x:=x+1 fi; od; od; od; od; x; end;
|
|
CROSSREFS
|
Cf. A000577.
Sequence in context: A064122 A057526 A033265 this_sequence A071068 A137735 A143966
Adjacent sequences: A096001 A096002 A096003 this_sequence A096005 A096006 A096007
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Boddington (psb(AT)maths.warwick.ac.uk), Jul 27 2004
|
|
|
Search completed in 0.002 seconds
|
