A355368 Maximal GCD of six positive integers with sum n.

1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 4, 1, 2, 3, 4, 1, 5, 1, 4, 3, 2, 5, 6, 1, 2, 3, 5, 1, 7, 1, 4, 5, 2, 1, 8, 7, 5, 3, 4, 1, 9, 5, 8, 3, 2, 1, 10, 1, 2, 9, 8, 5, 11, 1, 4, 3, 10, 1, 12, 1, 2, 5, 4, 11, 13, 1, 10, 9, 2, 1, 14, 5, 2, 3, 11, 1, 15, 13, 4, 3, 2

Offset

6,7

Links

Table of n, a(n) for n=6..94.

Mathematica

a[n_] := GCD @@@ IntegerPartitions[n, {6}] // Max;
Table[a[n], {n, 6, 100}] (* Jean-François Alcover, Sep 21 2022 *)

Crossrefs

Cf. A008881, A355367.

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), this sequence (k=6), A355402 (k=7), A354598 (k=8), A354599 (k=9), A354601 (k=10).

Sequence in context: A366522 A345934 A060775 * A175494 A055399 A029426

Adjacent sequences: A355365 A355366 A355367 * A355369 A355370 A355371

Keyword

nonn

Author

Wesley Ivan Hurt, Jun 29 2022

Status

approved