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.

A209866 a(n) = least common multiple of all cycle sizes in range [2^(n-1),(2^n)-1] of permutation A209861/A209862.

Original entry on oeis.org

1, 1, 1, 1, 2, 5, 24, 26, 672, 246, 3755388, 13827240, 1768910220, 99034598880, 1463488641762840, 612823600, 171768365608799778, 16338317307187487976, 27491145139913884194480, 14794457633180140325810400, 2084886621890359572790082258379649440
Offset: 0

Views

Author

Antti Karttunen, Mar 24 2012

Keywords

Comments

a(0) gives the LCM of cycle sizes in range [0,0], i.e., 1.

Examples

			In range [2^(6-1),(2^6)-1] ([32,63]) of permutations A209861 & A209862, there are 6 cycles of size 1 (fixed points), 2 cycles of size 3, one cycle of size 4, and 2 cycles of size 8 (6 + 2*3 + 4 + 2*8 = 32), thus a(6) = lcm(1,3,4,8) = 24.
		

Crossrefs