cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A061195 Minimum positive numerator of s_1/1 + ... + s_n/n in lowest terms, where each s_i equals 1 or -1.

This page as a plain text file.
%I A061195 #37 Jan 12 2020 17:40:46
%S A061195 1,1,1,1,7,1,11,9,11,11,23,23,607,251,59,25,97,97,2647,2647,1337,457,
%T A061195 8917,8917,7951,4261,12439,12439,587971,587971,9687661,13828799,
%U A061195 505163,1554793,1554793,1554793,1526171
%N A061195 Minimum positive numerator of s_1/1 + ... + s_n/n in lowest terms, where each s_i equals 1 or -1.
%e A061195 1/1 - 1/2 - 1/3 + 1/4 - 1/5 - 1/6 = 1/20, so a(6)=1.
%t A061195 nMax = 19; d = {0}; Table[d = Flatten[{d + 1/n, d - 1/n}]; Min[Abs[Numerator[d]]], {n, nMax}] (* _T. D. Noe_, Nov 19 2013 *)
%o A061195 (PARI) a(n) = {lcmn = 1;for (i=1, n, lcmn = lcm(i, lcmn)); minn = lcmn; for (i=0, 2^(n-1)-1, b = binary(i); while (#b != n, b = concat(0, b);); num = numerator(abs(sum(ii = 1, n, (-1)^b[ii]/ii))); minn = min(minn, num);); return(minn);} \\ _Michel Marcus_, Jun 15 2013
%Y A061195 Cf. A061194.
%Y A061195 Cf. A232090 (minimal possible denominator).
%K A061195 nonn
%O A061195 1,5
%A A061195 Greg Martin (gerg(AT)math.toronto.edu), Apr 19 2001
%E A061195 More terms from _Naohiro Nomoto_, Jun 24 2001
%E A061195 a(22)-a(25) from _Zak Seidov_, Nov 20 2013
%E A061195 a(26)-a(33) from _Zak Seidov_, Nov 24 2013
%E A061195 a(34)-a(37) from _Giovanni Resta_, Jun 12 2016