|
|
A355249
|
|
Maximal GCD of three positive integers with sum n.
|
|
8
|
|
|
1, 1, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 5, 4, 1, 6, 1, 5, 7, 2, 1, 8, 5, 2, 9, 7, 1, 10, 1, 8, 11, 2, 7, 12, 1, 2, 13, 10, 1, 14, 1, 11, 15, 2, 1, 16, 7, 10, 17, 13, 1, 18, 11, 14, 19, 2, 1, 20, 1, 2, 21, 16, 13, 22, 1, 17, 23, 14, 1, 24, 1, 2, 25, 19, 11, 26, 1, 20, 27, 2, 1, 28
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,4
|
|
LINKS
|
|
|
FORMULA
|
a(3n) = n for n >= 1.
a(p) = 1 for p prime >= 3. (End)
|
|
MATHEMATICA
|
a[n_] := GCD @@@ IntegerPartitions[n, {3}] // Max;
|
|
PROG
|
(Python)
from math import gcd
def a(n): return max(gcd(i, j, n-i-j) for i in range(1, n//3+1) for j in range(i, n//3+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|