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.

A225788 a(n) = floor(72*n^(1/2)*(log(n))^(3/2)) for n >= 1, a(0) = 0.

Original entry on oeis.org

0, 0, 58, 143, 235, 328, 422, 517, 610, 703, 795, 886, 976, 1066, 1154, 1242, 1329, 1415, 1501, 1585, 1669, 1752, 1835, 1917, 1998, 2079, 2159, 2238, 2317, 2395, 2473, 2551, 2627, 2704, 2780, 2855, 2930, 3005, 3079, 3152, 3226, 3299, 3371, 3443, 3515, 3587
Offset: 0

Views

Author

L. Edson Jeffery, May 16 2013

Keywords

Comments

Miklós Abért proved that the symmetric group S_n is a product of at most 72*n^(1/2)*(log(n))^(3/2) cyclic subgroups. Here we have taken the floor of the upper bound stated in the reference in which the author also states the lower bound of (1 + o(1))*(n*log(n))^(1/2) cyclic subgroups.

Programs

  • Mathematica
    Join[{0}, Table[Floor[72*n^(1/2)*(Log[n])^(3/2)], {n, 100}]] (* T. D. Noe, May 23 2013 *)

Extensions

Definition amended by Georg Fischer, Aug 31 2021