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.
%I A125741 #4 Mar 31 2012 13:20:34
%S A125741 7,13,7,7,37,19,119,41,31,37,37,43,13,7,13,49,7,7,61,71,103,67,73,139,
%T A125741 17,79,19,29,97,103,223,109,37,359,7,49,7,127,953,7,139,41,151,1627,
%U A125741 157,797,179,13,163,13,13,13,13,13,31,31,181,193,199,919,193,211,757,37
%N A125741 The ratio of A117731(n) and A082687(n) when they are different.
%C A125741 Corresponding numbers n such that A117731(n) differs from A082687(n) are listed in A125740(n) = {14, 52, 98, 105, 111, 114, 119, 164, 310, 444, 518, 602, 676, 686, 715, 735, 749, 833, ...}. a(n) divides A125740(n). Most a(n) are primes.
%C A125741 The first composite term in a(n) is a(7) = 119 = 7*17. a(n) is composite for n = {7, 16, 36}. a(16) = a(36) = 49 = 7^2.
%F A125741 a(n) = A117731[ A125740(n) ] / A082687[ A125740(n) ].
%e A125741 A082687(n) begins {1, 7, 37, 533, 1627, 18107, 237371, 95549, 1632341, 155685007, 156188887, 3602044091, 18051406831, 7751493599, ...}.
%e A125741 Thus a(1) = 7 because A117731(n)/A082687(n) = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1,...}.
%t A125741 h=0; Do[ h=h+1/(n+1)/(2n+1); f=Numerator[n*h]; g=Numerator[h]; If[ !Equal[f,g], Print[ {n,f/g} ] ], {n,1,10000} ]
%Y A125741 Cf. A125740 = numbers n such that A117731(n) differs from A082687(n). Cf. A117731 = Numerator of n*Sum[ 1/(n+k), {k, 1, n} ]. Cf. A082687 = Numerator of Sum[ 1/(n+k), {k, 1, n} ].
%K A125741 hard,nonn
%O A125741 1,1
%A A125741 _Alexander Adamchuk_, Dec 04 2006