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.

Showing 1-2 of 2 results.

A284664 Number of proper colorings of the 2n-gon with 2 instances of each of n colors under rotational symmetry.

Original entry on oeis.org

0, 1, 5, 96, 3528, 199620, 15908400, 1697149440, 233631921600, 40335000693120, 8536048230528000, 2173422135804796800, 655519296840629760000, 231135191421131129932800, 94208725354330431747302400, 43956400457238853734678528000, 23278422600113660887881093120000
Offset: 1

Views

Author

Marko Riedel, Mar 31 2017

Keywords

Examples

			When n=2 the coloring of the nodes of the square with two instances each of black and white must alternate and a rotation by Pi/4 takes one coloring to the other, so there is just one coloring.
		

Crossrefs

Formula

For n>=2, (1/2)(n-1)! + (1/(2n)) * Sum_{p=0..n} C(n,p) ((-1)^p/2^(n-p)) ((2n-p)! + p(2n-p-1)!).

A284747 Number of proper colorings of the 2n-gon with 2 instances of each of n colors under dihedral (rotational and reflectional) symmetry.

Original entry on oeis.org

0, 1, 4, 54, 1794, 99990, 7955460, 848584800, 116816051520, 20167501253760, 4268024125243200, 1086711068022148800, 327759648421871635200, 115567595710587359539200, 47104362677165542792243200, 21978200228619432098036736000, 11639211300056830532862403584000, 6943663015969522875618267601920000
Offset: 1

Views

Author

Marko Riedel, Apr 01 2017

Keywords

Examples

			When n=2 the coloring of the nodes of the square with two instances each of black and white must alternate and a rotation by Pi/4 takes one coloring to the other, so there is just one coloring.
		

Crossrefs

Formula

For n>=2, (1/4)(n-1)! + (1/4)n! + (1/(4n)) * Sum_{p=0..n} C(n,p) ((-1)^p/2^(n-p)) ((2n-p)! + p(2n-p-1)!).
Showing 1-2 of 2 results.