|
Search: id:A005038
|
|
|
| A005038 |
|
Number of ways of dissecting a polygon into n hexagons.
(Formerly M2026)
|
|
+0
3
|
|
| 1, 1, 2, 12, 57, 366, 2340, 16252, 115940, 854981, 6444826, 49554420, 387203390, 3068067060, 24604111560, 199398960212, 1631041938108, 13451978877748
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.
|
|
MATHEMATICA
|
p=5; Table[Binomial[(p-1)n, n]/(((p-2)n+1)((p-2)n+2)) +If[OddQ[n], 0, Binomial[(p-1)n/2, n/2]/((p-2)n+2)]+Plus @@ Map[EulerPhi[ # ]Binomial[((p-1)n+1)/#, (n-1)/# ]/((p-1)n+1)&, Complement[Divisors[GCD[p, n-1]], {1}]], {n, 1, 20}] - Robert A. Russell (russell(AT)post.harvard.edu), Dec 11 2004
|
|
CROSSREFS
|
Adjacent sequences: A005035 A005036 A005037 this_sequence A005039 A005040 A005041
Sequence in context: A105487 A098453 A067125 this_sequence A094780 A100103 A054145
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
