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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120445 Number of different convex inscribed polygons with n pair of sides of lengths d1, d2, ..., dn; di =/= dj if i=/=j. Or number of necklaces with n pairs of beads, each pair of one among n colors. 0
1, 2, 11, 171, 5736, 312240, 24327000, 2554072920, 347351195520, 59397023589120, 12473374574505600, 3155763762320400000, 946729128624509260800, 332301924146113021900800, 134914581203304233287756800 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

n-digonos.

FORMULA

a(n) = ((2n)!/2^n + (n+1)*n! + n*n!)/(4n)

EXAMPLE

a(2) = 2 because there are two quadrilaterals with sides {1, 1, 2, 2}: a comet and a rectangle.

CROSSREFS

Sequence in context: A197336 A013050 A051255 * A003088 A121231 A122527

Adjacent sequences:  A120442 A120443 A120444 * A120446 A120447 A120448

KEYWORD

nonn

AUTHOR

Ignacio Larrosa Canestro (ilarrosa(AT)mundo-r.com), Jul 19 2006

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 14 08:06 EST 2012. Contains 205604 sequences.