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 #31 Oct 16 2024 22:28:09
%S 1,3,6,8,13,13,20,24,30,30,41,41,54,54,55,63,80,80,99,99,103,103,126,
%T 126,146,146,159,164,193,193,224,235,235,235,238,238,275,275,275,275,
%U 316,316,359,360,360,360,407,407,446,446,453,459,512,512,531,531,535
%N Maximum sum of relatively prime integers no larger than n.
%H Matt Ready, <a href="/A186736/b186736.txt">Table of n, a(n) for n = 1..2500</a> (first 250 terms from Michael B. Porter)
%H Michael B. Porter (w/ minor bug fix from Matt Ready), <a href="/A186736/a186736.txt">PARI program</a>
%H Matt Ready, <a href="/A186736/a186736.py.txt">Python program, alternate algorithm</a>
%e a(30) = 193, for the set {1, 11, 13, 17, 19, 23, 25, 27, 28, 29}.
%e a(51) = 453, for the set {1, 13, 19, 23, 25, 29, 31, 37, 41, 43, 44, 47, 49, 51}. - _Matt Ready_, Oct 05 2024
%o (PARI) \\ see link
%o (Python) # see link
%K nonn
%O 1,2
%A _Andy Niedermaier_, Aug 29 2013
%E a(31)-a(47) from _Alois P. Heinz_, Aug 29 2013
%E a(51) corrected by _Matt Ready_, Oct 05 2024