Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Feb 05 2014 20:57:18
%S 3,5,10,18,23,37,39,58,67,119,138,178,181,250,274,307,338,359,515,551,
%T 738,778,933,1157,1418,1425,1479,1559,1738,1762,1922,1970,2410,2417,
%U 3265
%N Largest number in an integer 7-tuple (a, b, c, d, e, f, g) satisfying the Markoff(7) equation a^2+b^2+c^2+d^2+e^2+f^2+g^2 = a*b*c*d*e*f*g.
%e 3 and 5 are in the sequence since (3, 2, 2, 2, 1, 1, 1) and (5, 2, 2, 2, 1, 1, 1) satisfy a^2+b^2+c^2+d^2+e^2+f^2+g^2 = a*b*c*d*e*f*g with a >= b >= c >= d >= e >= f >= g.
%Y Cf. A002559.
%K nonn
%O 1,1
%A _Shanzhen Gao_, Sep 19 2013