login
Maximal GCD of six positive integers with sum n.
9

%I #12 Sep 21 2022 07:42:00

%S 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,

%T 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,

%U 12,1,2,5,4,11,13,1,10,9,2,1,14,5,2,3,11,1,15,13,4,3,2

%N Maximal GCD of six positive integers with sum n.

%t a[n_] := GCD @@@ IntegerPartitions[n, {6}] // Max;

%t Table[a[n], {n, 6, 100}] (* _Jean-François Alcover_, Sep 21 2022 *)

%Y Cf. A008881, A355367.

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

%K nonn

%O 6,7

%A _Wesley Ivan Hurt_, Jun 29 2022