cp's OEIS Frontend

A006232 Numerators of Cauchy numbers of first type.

%I A006232 M5067 #113 Feb 16 2025 08:32:29
%S A006232 1,1,-1,1,-19,9,-863,1375,-33953,57281,-3250433,1891755,-13695779093,
%T A006232 24466579093,-132282840127,240208245823,-111956703448001,
%U A006232 4573423873125,-30342376302478019,56310194579604163
%N A006232 Numerators of Cauchy numbers of first type.
%C A006232 The corresponding denominators are given in A006233.
%C A006232 -a(n+1), n>=0, also numerators from e.g.f. 1/x-1/log(1+x), with denominators A075178(n). |a(n+1)|, n>=0, numerators from e.g.f. 1/x+1/log(1-x) with denominators A075178(n). For formula of unsigned a(n) see A075178.
%C A006232 The signed rationals a(n)/A006233(n) provide the a-sequence for the Stirling2 Sheffer matrix A048993. See the W. Lang link concerning Sheffer a- and z-sequences.
%C A006232 Cauchy numbers of the first type are also called Bernoulli numbers of the second kind.
%C A006232 Named after the French mathematician, engineer and physicist Augustin-Louis Cauchy (1789-1857). - _Amiram Eldar_, Jun 17 2021
%D A006232 Louis Comtet, Advanced Combinatorics, Reidel, 1974, p. 294.
%D A006232 Harold Jeffreys and B. S. Jeffreys, Methods of Mathematical Physics, Cambridge, 1946, p. 259.
%D A006232 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006232 T. D. Noe, <a href="/A006232/b006232.txt">Table of n, a(n) for n=0..100</a>
%H A006232 Arnold Adelberg, <a href="http://dx.doi.org/10.1006/jnth.1998.2278">2-adic congruences of Norland numbers and of Bernoulli numbers of the second kind</a>, J. Number Theory, Vol. 73, No. 1 (1998), pp. 47-58.
%H A006232 I. S. Gradsteyn and I. M. Ryzhik, <a href="http://mathtable.com/gr/index.html">Table of integrals, series and products</a>, (1980), page 2 (formula 0.131).
%H A006232 L. B. W. Jolley, <a href="https://archive.org/details/summationofserie00joll">Summation of Series</a>, Dover, (1961) (formula 70).
%H A006232 Wolfdieter Lang, <a href="/A006232/a006232.pdf">Sheffer a- and z-sequences</a>.
%H A006232 Wolfdieter Lang, <a href="https://arxiv.org/abs/1708.01421">On Generating functions of Diagonals Sequences of Sheffer and Riordan Number Triangles</a>, arXiv:1708.01421 [math.NT], August 2017.
%H A006232 Hong-Mei Liu, Shu-Hua Qi and Shu-Yan Ding, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Liu/liu4.html">Some Recurrence Relations for Cauchy Numbers of the First Kind</a>, JIS, Vol. 13 (2010), Article 10.3.8.
%H A006232 Rui-Li Liu and Feng-Zhen Zhao, <a href="https://hosted.math.rochester.edu/ojac/vol14/183.pdf">Log-concavity of two sequences related to Cauchy numbers of two kinds</a>, Online Journal of Analytic Combinatorics, Issue 14 (2019), #09.
%H A006232 Donatella Merlini, Renzo Sprugnoli and M. Cecilia Verri, <a href="http://dx.doi.org/10.1016/j.disc.2006.03.065">The Cauchy numbers</a>, Discrete Math., Vol. 306, No. 16 (2006), pp. 1906-1920.
%H A006232 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BernoulliNumberoftheSecondKind.html">Bernoulli Numbers of the Second Kind</a>.
%H A006232 Ming Wu and Hao Pan, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/45-2/quartpan02_2007.pdf">Sums of products of Bernoulli numbers of the second kind</a>, Fib. Quart., Vol. 45, No. 2 (2007), pp. 146-150.
%H A006232 Feng-Zhen Zhao, <a href="http://dx.doi.org/10.1016/j.disc.2008.10.013">Sums of products of Cauchy numbers</a>, Discrete Math., Vol. 309, No. 12 (2009), pp. 3830-3842.
%F A006232 Numerator of integral of x(x-1)...(x-n+1) from 0 to 1.
%F A006232 E.g.f.: x/log(1+x). (Note: the numerator of the coefficient of x^n/n! is a(n) - _Michael Somos_, Jul 12 2014)
%F A006232 Numerator of Sum_{k=0..n} A048994(n,k)/(k+1). - _Peter Luschny_, Apr 28 2009
%F A006232 Sum_{k=1..n} 1/k = C + log(n) + 1/(2n) + Sum_{k=2..inf} |a(n)|/A075178(n-1) * 1/(n*(n+1)*...*(n+k-1)) (section 0.131 in Gradshteyn and Ryzhik tables). - _Ralf Stephan_, Jul 12 2014
%F A006232 a(n) = numerator(f(n) * n!), where f(0) = 1, f(n) = Sum_{k=0..n-1} (-1)^(n-k+1) * f(k) / (n-k+1). - _Daniel Suteu_, Feb 23 2018
%F A006232 Sum_{k = 1..n} (1/k) = A001620 + log(n) + 1/(2n) - Sum_{k >= 2} abs((a(k)/A006233(k)/k/(Product_{j = 0..k-1} (n-j)))), (see I. S. Gradsteyn, I. M. Ryzhik). - _A.H.M. Smeets_, Nov 14 2018
%e A006232 1, 1/2, -1/6, 1/4, -19/30, 9/4, -863/84, 1375/24, -33953/90, ...
%p A006232 seq(numer(add(stirling1(n,k)/(k+1),k=0..n)),n=0..20); # _Peter Luschny_, Apr 28 2009
%t A006232 a[n_] := Numerator[ Sum[ StirlingS1[n, k]/(k + 1), {k, 0, n}]]; Table[a[n], {n, 0, 19}] (* _Jean-François Alcover_, Nov 03 2011, after Maple *)
%t A006232 a[n_] := Numerator[ Integrate[ Gamma[x+1]/Gamma[x-n+1], {x, 0, 1}]]; Table[a[n], {n, 0, 19}] (* _Jean-François Alcover_, Jul 29 2013 *)
%t A006232 a[ n_] := If[ n < 0, 0, (-1)^n Numerator @ Integrate[ Pochhammer[ -x, n], {x, 0, 1}]]; (* _Michael Somos_, Jul 12 2014 *)
%t A006232 a[ n_] := If[ n < 0, 0, Numerator [ n! SeriesCoefficient[ x / Log[ 1 + x], {x, 0, n}]]]; (* _Michael Somos_, Jul 12 2014 *)
%t A006232 Join[{1}, Array[Numerator[(1/#) Integrate[Product[(x - k), {k, 0, # - 1}], {x, 0, 1}]] &, 25]] (* _Michael De Vlieger_, Nov 13 2018 *)
%o A006232 (Sage)
%o A006232 def A006232_list(len):
%o A006232     f, R, C = 1, [1], [1]+[0]*(len-1)
%o A006232     for n in (1..len-1):
%o A006232         for k in range(n, 0, -1):
%o A006232             C[k] = -C[k-1] * k / (k + 1)
%o A006232         C[0] = -sum(C[k] for k in (1..n))
%o A006232         R.append((C[0]*f).numerator())
%o A006232         f *= n
%o A006232     return R
%o A006232 print(A006232_list(20)) # _Peter Luschny_, Feb 19 2016
%o A006232 (PARI) for(n=0,20, print1(numerator( sum(k=0,n, stirling(n, k, 1)/(k+1)) ), ", ")) \\ _G. C. Greubel_, Nov 13 2018
%o A006232 (Magma) [Numerator((&+[StirlingFirst(n,k)/(k+1): k in [0..n]])): n in [0..20]]; // _G. C. Greubel_, Nov 13 2018
%o A006232 (Python) # Results are abs values
%o A006232 from fractions import gcd
%o A006232 aa,n,sden = [0,1],1,1
%o A006232 while n < 20:
%o A006232     j,snom,sden,a = 1,0,(n+1)*sden,0
%o A006232     while j < len(aa):
%o A006232         snom,j = snom+aa[j]*(sden//(j+1)),j+1
%o A006232     nom,den = snom,sden
%o A006232     print(n,nom//gcd(nom,den))
%o A006232     aa,j = aa+[-aa[j-1]],j-1
%o A006232     while j > 0:
%o A006232         aa[j],j = n*aa[j]-aa[j-1],j-1
%o A006232     n = n+1 # _A.H.M. Smeets_, Nov 14 2018
%o A006232 (Python)
%o A006232 from fractions import Fraction
%o A006232 from sympy.functions.combinatorial.numbers import stirling
%o A006232 def A006232(n): return sum(Fraction(stirling(n,k,kind=1,signed=True),k+1) for k in range(n+1)).numerator # _Chai Wah Wu_, Jul 09 2023
%Y A006232 Cf. A006233 (denominators), A002206, A002207, A002208, A002209, A002657, A002790.
%K A006232 sign,frac,nice
%O A006232 0,5
%A A006232 _N. J. A. Sloane_