cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A085990 Number of topological types of polygons with 2n different sides.

Original entry on oeis.org

0, 3, 60, 2520, 181440, 19958400, 3113510400, 653837184000, 177843714048000, 60822550204416000, 25545471085854720000, 12926008369442488320000, 7755605021665492992000000, 5444434725209176080384000000, 4420880996869850977271808000000
Offset: 1

Views

Author

Sergey L. Dolmatov, Almir Dzhumaev (aalma(AT)mail.ru), Aug 18 2003

Keywords

Comments

a(n) equals (-1)^n times the coefficient of sqrt(1-x^2)*(arcsin x)^2 in int (arcsin x)^(2n-1) dx. - John M. Campbell, Jul 20 2011
For n >= 4, also the number of distinct adjacency matrices of the n-Moebius ladder. - Eric W. Weisstein, Mar 31 2017

Examples

			For example: if n=1 then no polygon exists with 2 different sides. If n=2 then the polygon has 4 different sides A, B, C, D. In this case 3 different types of such 4-angle exist: (A, B, C, D), (A, B, D, C), (A, C, B, D).
		

Crossrefs

Cf. A009445.

Programs

Formula

a(n) = (n-1)*(2*n-1)*(2*n-3)!
a(n) = (2n-1)!/2 = A009445(n)/2, for n>1. - Wesley Ivan Hurt, Mar 31 2015