login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005034 Number of dissections of a polygon.
(Formerly M1768)
0
1, 1, 1, 2, 7, 25, 108, 492, 2431, 12371, 65169, 350792, 1926372, 10744924, 60762760, 347653944, 2009690895, 11723100775, 68937782355, 408323229930, 2434289046255 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 290.

F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.

P. Leroux and B. Miloudi, ``G\'{e}n\'{e}ralisations de la formule d'Otter,'' Ann. Sci. Math. Qu\'{e}bec, Vol. 16, No. 1, pp. 53-80, 1992.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

MATHEMATICA

p=4; 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

Sequence in context: A150531 A150532 A074420 * A150533 A150534 A150535

Adjacent sequences:  A005031 A005032 A005033 * A005035 A005036 A005037

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:33 EST 2012. Contains 205694 sequences.