A354601 Maximal GCD of ten positive integers with sum n.

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, 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, 6, 1, 8, 3, 2, 1, 7, 5, 2, 3, 8, 1, 9, 7, 4, 3, 2, 5, 8, 1, 7, 9, 10

Offset: 10

Author

Wesley Ivan Hurt, Jul 08 2022

Keywords

• nonn

Crossrefs

Cf. A354600.

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).

Programs

Mathematica

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]]]];
a[n_] := If[n < 10, 0, b[n, n, 10]];
Table[a[n], {n, 10, 100}] (* Jean-François Alcover, Sep 21 2022, after Alois P. Heinz in A354599 *)