login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340516 Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1). 2
1, 2, 6, 24, 120, 120, 840, 3360, 30240, 30240, 332640, 332640, 4324320, 4324320, 4324320, 17297280, 294053760, 294053760, 5587021440, 5587021440, 5587021440, 5587021440, 128501493120, 128501493120, 3212537328000, 3212537328000, 28912835952000, 28912835952000, 838472242608000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This is a lower bound on A340515.
REFERENCES
Heffernan, Robert, Des MacHale, and Brendan McCann. "Cayley’s Theorem Revisited: Embeddings of Small Finite Groups." Mathematics Magazine 91.2 (2018): 103-111.
LINKS
Heffernan, Robert, Des MacHale, and Brendan McCann, Minimal embeddings of small finite groups, arXiv:1706.09286 [math.GR], 2017. See Lemma 2.
MATHEMATICA
{1}~Join~Table[Times @@ Map[#^(2 Floor@ Log[#, n] - 1) &, Prime@ Range@ PrimePi@ n], {n, 2, 30}] (* Michael De Vlieger, Feb 23 2022 *)
CROSSREFS
Sequence in context: A319545 A362698 A066616 * A340515 A308819 A319206
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 03 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:09 EDT 2024. Contains 370951 sequences. (Running on oeis4.)