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.
%I A379424 #20 Jan 20 2025 00:47:47 %S A379424 1,7,31,211,1333,6541,45787,281263,1968841,13781887,93098053, %T A379424 649998793,4549991551,31849940857,215149600483,1506047203381, %U A379424 10542330423667,86982188480467,587573558919073,4113014912433511,28791104387034577,247368468304929733 %N A379424 Least modulus k such that the multiplicative group modulo k has a difference of n nontrivial cycles between its minimal and maximal representation. %C A379424 This is equal to the least modulus k such that (Z/kZ)* has a representation as a direct product of cyclic groups, of which n are odd cycles. The number of even cycles in the maximal representation is equal to the total cycles in the minimal representation. %H A379424 Asher Gray, <a href="/A379424/b379424.txt">Table of n, a(n) for n = 0..500</a> %H A379424 Asher Gray, <a href="https://github.com/thegraycuber/least_modulus_with_n_cycles">Least modulus with n cycles</a>, Github repository. %H A379424 Asher Gray, <a href="https://youtu.be/jCfoeqmQNeQ?si=3OqfUkYdQ7-MYvR6">Sequences from Group Theory</a>, YouTube Video. %e A379424 a(4) = 1333 because (Z/1333Z) ≅ C210 x C6 ≅ C2 x C3 x C5 x C2 x C3 x C7. The first representation has 2 cycles and the second has 6, a difference of 4. %Y A379424 Cf. A102476, A379423. %K A379424 nonn %O A379424 0,2 %A A379424 _Asher Gray_, Dec 22 2024