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 A354601 #17 Sep 21 2022 09:43:26
%S A354601 1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,3,1,2,3,2,1,3,1,2,3,4,1,3,1,
%T A354601 4,3,2,1,4,1,5,3,4,1,3,5,4,3,2,1,6,1,2,3,4,5,6,1,4,3,7,1,6,1,2,5,4,7,
%U A354601 6,1,8,3,2,1,7,5,2,3,8,1,9,7,4,3,2,5,8,1,7,9,10
%N A354601 Maximal GCD of ten positive integers with sum n.
%t A354601 b[n_, i_, t_] := b[n, i, t] = If[n == 0, Sign[t], If[Min[i, t] < 1, 1, Max[b[n, i - 1, t], GCD[b[n - i, Min[n - i, i], t - 1], i]]]];
%t A354601 a[n_] := If[n < 10, 0, b[n, n, 10]];
%t A354601 Table[a[n], {n, 10, 100}] (* _Jean-François Alcover_, Sep 21 2022, after _Alois P. Heinz_ in A354599 *)
%Y A354601 Cf. A354600.
%Y A354601 Maximal GCD of k positive integers with sum n for k = 2..10: A032742 (k=2,n>=2), A355249 (k=3), A355319 (k=4), A355366 (k=5), A355368 (k=6), A355402 (k=7), A354598 (k=8), A354599 (k=9), this sequence (k=10).
%K A354601 nonn
%O A354601 10,11
%A A354601 _Wesley Ivan Hurt_, Jul 08 2022