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 A096617 #51 Apr 06 2025 05:31:16
%S A096617 1,3,11,25,137,147,363,761,7129,7381,83711,86021,1145993,1171733,
%T A096617 1195757,2436559,42142223,42822903,275295799,279175675,56574159,
%U A096617 19093197,444316699,1347822955,34052522467,34395742267,312536252003
%N A096617 Numerator of n*HarmonicNumber(n).
%C A096617 a(1) = 1, a(n) = Numerator( H(n) / H(n-1) ), where H(n) = HarmonicNumber(n) = A001008(n)/A002805(n). - _Alexander Adamchuk_, Oct 29 2004
%C A096617 Sampling a population of n distinct elements with replacement, n HarmonicNumber(n) is the expectation of the sample size for the acquisition of all n distinct elements. - _Franz Vrabec_, Oct 30 2004
%C A096617 p^2 divides a(p-1) for prime p>3. - _Alexander Adamchuk_, Jul 16 2006
%C A096617 It appears that a(n) = b(n) defined by b(n+1) = b(n)*(n+1)/g(n) + f(n), f(n) = n*f(n-1)/g(n) and g(n) = gcd(b(n)*(n+1), n*f(n-1)), b(1) = f(1) = g(1) = 1, i.e., the recurrent formula of A000254(n) where both terms are divided by their GCD at each step (and remain divided by this factor in the sequel). Is this easy to prove? - _M. F. Hasler_, Jul 04 2019
%D A096617 W. Feller, An Introduction to Probability Theory and Its Applications, Vol. I, 2nd Ed. 1957, p. 211, formula (3.3)
%H A096617 Vincenzo Librandi, <a href="/A096617/b096617.txt">Table of n, a(n) for n = 1..1000</a>
%H A096617 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteSet.html">Complete Set</a>
%F A096617 a(n) = abs(Stirling1(n+1, 2))/(n-1)!. - _Vladeta Jovovic_, Jul 06 2004
%F A096617 a(n) = numerator of Integral_{t=0..oo} 1-(1-exp(-t/n))^n dt. - _Jean-François Alcover_, Feb 17 2014
%e A096617 1, 3, 11/2, 25/3, 137/12, 147/10, 363/20, 761/35, 7129/280, ...
%p A096617 ZL:=n->sum(sum(1/i, i=1..n), j=1..n): a:=n->floor(numer(ZL(n))): seq(a(n), n=1..27); # _Zerinvary Lajos_, Jun 14 2007
%t A096617 Numerator[Table[(Sum[(1/k), {k, 1, n}]/Sum[(1/k), {k, 1, n-1}]), {n, 1, 20}]] (* _Alexander Adamchuk_, Oct 29 2004 *)
%t A096617 Table[n*HarmonicNumber[n] // Numerator, {n, 1, 27}] (* _Jean-François Alcover_, Feb 17 2014 *)
%o A096617 (Magma) [Numerator(n*HarmonicNumber(n)): n in [1..40]]; // _Vincenzo Librandi_, Feb 19 2014
%o A096617 (PARI) {h(n) = sum(k=1,n,1/k)};
%o A096617 for(n=1,50, print1(numerator(n*h(n)), ", ")) \\ _G. C. Greubel_, Sep 01 2018
%o A096617 (PARI) A=List(f=1); for(k=1,999, t=[A[k]*(k+1),f*=k]; t/=gcd(t); listput(A,t[1]+f=t[2])) \\ Illustrate conjectured equality. - _M. F. Hasler_, Jul 04 2019
%Y A096617 Cf. A027611, A001008, A002805.
%Y A096617 Differs from A025529 at 7th term.
%Y A096617 Cf. A193758.
%K A096617 nonn,frac
%O A096617 1,2
%A A096617 _Eric W. Weisstein_, Jul 01 2004