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 A355572 #16 Jul 13 2022 07:23:42 %S A355572 1,1,3,3,5,5,7,15,15,21,21,35,35,45,105,105,105,105,165,165,315,315, %T A355572 385,385,495,1155,1155,1365,1365,1365,1365,3465,3465,4095,4095,5005, %U A355572 5005,6435,15015,15015,15015,15015,19635,19635,45045,45045,45045,45045,58905,58905,69615,69615 %N A355572 Largest LCM of partitions of n into odd parts. %C A355572 The largest LCM is attained for a partition of n into powers of distinct odd primes and 1's. %H A355572 Petr Gregor, Arturo Merino, and Torsten Mütze, <a href="https://arxiv.org/abs/2205.08126">The Hamilton compression of highly symmetric graphs</a>, arXiv preprint arXiv:2205.08126 [math.CO], 2022. %e A355572 The partitions of n=8 into odd parts are 7+1, 5+3, 5+1+1+1, 3+3+1+1, 3+1+1+1+1+1, 1+1+1+1+1+1+1+1, and the partition with largest LCM among those is 5+3, which has LCM(5,3)=5*3=15, so a(8)=15. %o A355572 (PARI) a(n) = my(x=1); forpart(p=n, if (!#select(x->((x%2)==0), Vec(p)), x = max(x, lcm(Vec(p))))); x; \\ _Michel Marcus_, Jul 08 2022 %Y A355572 Cf. A000793, A051593, A355573, A159685. %K A355572 nonn %O A355572 1,3 %A A355572 _Torsten Muetze_, Jul 07 2022