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 A355573 #14 Jul 13 2022 07:23:26 %S A355573 2,2,4,6,6,12,12,20,30,30,60,60,84,84,140,210,210,420,420,420,420,840, %T A355573 840,1260,1260,1540,2310,2520,4620,4620,5460,5460,9240,9240,13860, %U A355573 13860,16380,16380,27720,30030,32760,60060,60060,60060,60060,120120,120120,180180,180180,180180,180180 %N A355573 Largest LCM of partitions of n with a nonzero even number of even parts. %C A355573 The largest LCM is attained for a partition of n into powers of distinct odd primes, 2^k for some k>0, 2, and 1's. %H A355573 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 A355573 The partitions of n=8 with a nonzero even number of even parts are 6+2, 4+4, 4+2+1+1, 3+2+2+1, 2+2+2+2, 2+2+1+1+1+1, and the partition with largest LCM among those is 3+2+2+1, which has LCM(3,2,2,1)=3*2=6, so a(8)=6. %Y A355573 Cf. A000793, A051593, A355572, A159685. %K A355573 nonn %O A355573 4,1 %A A355573 _Torsten Muetze_, Jul 07 2022