[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A355572 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Largest LCM of partitions of n into odd parts.
(history; published version)
#16 by Bruno Berselli at Wed Jul 13 07:23:42 EDT 2022
STATUS

reviewed

approved

#15 by Joerg Arndt at Wed Jul 13 07:04:27 EDT 2022
STATUS

proposed

reviewed

#14 by Michel Marcus at Fri Jul 08 12:34:13 EDT 2022
STATUS

editing

proposed

#13 by Michel Marcus at Fri Jul 08 12:34:09 EDT 2022
PROG

(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

STATUS

proposed

editing

#12 by Torsten Muetze at Fri Jul 08 02:19:10 EDT 2022
STATUS

editing

proposed

#11 by Torsten Muetze at Fri Jul 08 02:18:32 EDT 2022
CROSSREFS
STATUS

proposed

editing

Discussion
Fri Jul 08
02:19
Torsten Muetze: Added related sequence reference
#10 by Jon E. Schoenfield at Thu Jul 07 19:12:32 EDT 2022
STATUS

editing

proposed

#9 by Jon E. Schoenfield at Thu Jul 07 19:12:30 EDT 2022
COMMENTS

The largest LCM is attained for a partition of n into powers of distinct odd primes and 1s1's.

STATUS

proposed

editing

#8 by Michel Marcus at Thu Jul 07 17:53:57 EDT 2022
STATUS

editing

proposed

#7 by Michel Marcus at Thu Jul 07 17:53:50 EDT 2022
NAME

Largest LCM of partitions of n into odd parts.

DATA

1, 1, 3, 3, 5, 5, 7, 15, 15, 21, 21, 35, 35, 45, 105, 105, 105, 105, 165, 165, 315, 315, 385, 385, 495, 1155, 1155, 1365, 1365, 1365, 1365, 3465, 3465, 4095, 4095, 5005, 5005, 6435, 15015, 15015, 15015, 15015, 19635, 19635, 45045, 45045, 45045, 45045, 58905, 58905, 69615, 69615, 85085, 85085, 109395, 255255, 255255, 285285, 285285, 285285, 285285, 765765, 765765, 855855, 855855, 855855, 855855, 1119195, 1119195, 1322685, 1322685, 1616615, 1616615, 2078505, 4849845, 4849845, 4849845, 4849845, 5870865, 5870865, 14549535, 14549535, 14549535, 14549535, 17612595, 17612595, 19684665, 19684665, 19684665, 19684665, 25741485, 25741485, 30421755, 30421755, 37182145, 37182145, 47805615, 111546435, 111546435, 111546435, 111546435, 111546435, 111546435, 334639305, 334639305, 334639305, 334639305, 334639305, 334639305, 421936515, 421936515, 451035585, 451035585, 510765255, 510765255, 570855285, 570855285, 610224615, 610224615, 746503065, 746503065, 1003917915, 1003917915, 1673196525, 1673196525, 1673196525, 3234846615, 3234846615, 3457939485, 3457939485, 3457939485, 3457939485, 9704539845, 9704539845, 10373818455, 10373818455, 10373818455, 10373818455, 10373818455, 10373818455

LINKS

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.