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.
a[1] = 3;
a[n_] := a[n] = Module[{}, For[m = a[n-1], True, m++, If[AllTrue[Range[m, 2 m], Prime[#] + Prime[# - 1] < Prime[2# - n]&], Return[m]]]];
Table[Print[n, " ", a[n]]; a[n], {n, 1, 100}] (* Jean-François Alcover, Nov 27 2018 *)
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.
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
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.
Comments