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.

Showing 1-10 of 15 results. Next

A001620 Decimal expansion of Euler's constant (or the Euler-Mascheroni constant), gamma.

Original entry on oeis.org

5, 7, 7, 2, 1, 5, 6, 6, 4, 9, 0, 1, 5, 3, 2, 8, 6, 0, 6, 0, 6, 5, 1, 2, 0, 9, 0, 0, 8, 2, 4, 0, 2, 4, 3, 1, 0, 4, 2, 1, 5, 9, 3, 3, 5, 9, 3, 9, 9, 2, 3, 5, 9, 8, 8, 0, 5, 7, 6, 7, 2, 3, 4, 8, 8, 4, 8, 6, 7, 7, 2, 6, 7, 7, 7, 6, 6, 4, 6, 7, 0, 9, 3, 6, 9, 4, 7, 0, 6, 3, 2, 9, 1, 7, 4, 6, 7, 4, 9
Offset: 0

Views

Author

Keywords

Comments

Yee (2010) computed 29844489545 decimal digits of gamma.
Decimal expansion of 0th Stieltjes constant. - Paul Muljadi, Aug 24 2010
The value of Euler's constant is close to (18/Pi^2)*Sum_{n>=0} 1/4^(2^n) = 0.5770836328... = (6/5) * A082020 * A078585. - Arkadiusz Wesolowski, Mar 27 2012

Examples

			0.577215664901532860606512090082402431042...
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 3.
  • John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 24, 259-262.
  • S. R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, pp. 28-40, 166, 365.
  • C. F. Gauss, Disquisitiones Arithmeticae, Yale, 1965; see p. 359.
  • B. Gugger, Problèmes corrigés de Mathématiques posés aux concours des Ecoles Militaires, Ecole de l'Air, 1992, option MP, 1ère épreuve, Ellipses, 1993, pp. 167-184.
  • Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.3 Infinite Series, pp. 273-274.
  • J. Havil, Gamma: Exploring Euler's Constant, Princeton Univ. Press, 2003.
  • J.-M. Monier, Analyse, Exercices corrigés, 2ème année, MP, Dunod, Exercice 4.3.14, pages 371 and 387, 1997.
  • Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 166.
  • Joel L. Schiff, The Laplace Transform: Theory and Applications, Springer-Verlag New York, Inc. (1999). See p. 44.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 1, equation 1:7:5 at page 13.
  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 28.
  • E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, Cambridge Univ. Press, 4th ed., 1990.

Crossrefs

Cf. A002852 (continued fraction).
Cf. A073004 (exp(gamma)) and A094640 ("alternating Euler constant").
Cf. A231095 (power tower using this constant).
Denote the generalized Euler constants, also called Stieltjes constants, by Sti(n).
Sti(0) = A001620 (Euler's constant gamma) (cf. A262235/A075266),
Sti(1/2) = A301816, Sti(1) = A082633 (cf. A262382/A262383), Sti(3/2) = A301817,
Sti(2) = A086279 (cf. A262384/A262385), Sti(3) = A086280 (cf. A262386/A262387),
Sti(4) = A086281, Sti(5) = A086282, Sti(6) = A183141, Sti(7) = A183167,
Sti(8) = A183206, Sti(9) = A184853, Sti(10) = A184854.

Programs

  • Magma
    EulerGamma(250); // G. C. Greubel, Aug 21 2018
    
  • Maple
    Digits := 100; evalf(gamma);
  • Mathematica
    RealDigits[ EulerGamma, 10, 105][[1]] (* Robert G. Wilson v, Nov 01 2004 *)
    (1/2) N[Sum[PolyGamma[0, 1/2 + 2^k] - PolyGamma[0, 2^k], {k, 0, Infinity }], 30] (* Dimitri Papadopoulos, Nov 30 2016 *)
  • PARI
    default(realprecision, 20080); x=Euler; d=0; for (n=0, 20000, x=(x-d)*10; d=floor(x); write("b001620.txt", n, " ", d));  \\ Harry J. Smith, Apr 15 2009
    
  • Python
    from sympy import S
    def aupton(digs): return [int(d) for d in str(S.EulerGamma.n(digs+2))[2:-2]]
    print(aupton(99)) # Michael S. Branicky, Nov 22 2021

Formula

Limit_{n->oo} (1 + 1/2 + ... + 1/n - log(n)) (definition).
Sum_{n>=1} (1/n - log(1 + 1/n)), since log(1 + 1/1) + ... + log(1 + 1/n) telescopes to log(n+1) and lim_{n->infinity} (log(n+1) - log(n)) = 0.
Integral_{x=0..1} -log(log(1/x)). - Robert G. Wilson v, Jan 04 2006
Integral_{x=0..1,y=0..1} (x-1)/((1-x*y)*log(x*y)). - (see Sondow 2005)
Integral_{x=0..oo} -log(x)*exp(-x). - Jean-François Alcover, Mar 22 2013
Integral_{x=0..1} (1 - exp(-x) - exp(-1/x))/x. - Jean-François Alcover, Apr 11 2013
Equals the lim_{n->oo} fractional part of zeta(1+1/n). The corresponding fractional part for x->1 from below, using n-1/n, is -(1-a(n)). The fractional part found in this way for the first derivative of Zeta as x->1 is A252898. - Richard R. Forberg, Dec 24 2014
Limit_{x->1} (Zeta(x)-1/(x-1)) from Whittaker and Watson. 1990. - Richard R. Forberg, Dec 30 2014
exp(gamma) = lim_{i->oo} exp(H(i)) - exp(H(i-1)), where H(i) = i-th Harmonic number. For a given n this converges faster than the standard definition, and two above, after taking the logarithm (e.g., 13 digits vs. 6 digits at n=3000000 or x=1+1/3000000). - Richard R. Forberg, Jan 08 2015
Limit_{n->oo} (1/2) Sum_{j>=1} Sum_{k=1..n} ((1 - 2*k + 2*n)/((-1 + k + j*n) (k + j*n))). - Dimitri Papadopoulos, Jan 13 2016
Equals 25/27 minus lim_{x->oo} 2^(x+1)/3 - (22/27)*(4/3)^x - Zeta(Sum_{i>=1} (H_i/i^x)), letting H_i denote the i-th harmonic number. - John M. Campbell, Jan 29 2016
Limit_{x->0} -B'(x), where B(x) = -x zeta(1-x) is the "Bernoulli function". - Jean-François Alcover, May 20 2016
Sum_{k>=0} (1/2)(digamma(1/2+2^k) - digamma(2^k)) where digamma(x) = d/dx log(Gamma(x)). - Dimitri Papadopoulos, Nov 14 2016
Using the abbreviations a = log(z^2 + 1/4)/2, b = arctan(2*z) and c = cosh(Pi*z) then gamma = -Pi*Integral_{0..oo} a/c^2. The general case is for n >= 0 (which includes Euler's gamma as gamma_0) gamma_n = -(Pi/(n+1))* Integral_{0..oo} sigma(n+1)/c^2, where sigma(n) = Sum_{k=0..floor(n/2)} (-1)^k*binomial(n,2*k)*b^(2*k) *a^(n-2*k). - Peter Luschny, Apr 19 2018
Limit_{s->0} (Zeta'(1-s)*s - Zeta(1-s)) / (Zeta(1-s)*s). - Peter Luschny, Jun 18 2018
log(2) * (gamma - (1/2) * log(2)) = -Sum_{v >= 1} (1/2^(v+1)) * (Delta^v (log(w)/w))|{w=1}, where Delta(f(w)) = f(w) - f(w + 1) (forward difference). [This is a formula from Lerch (1897).] - _Petros Hadjicostas, Jul 21 2019
From Amiram Eldar, Jul 05 2020: (Start)
Equals Integral_{x=1..oo} (1/floor(x) - 1/x) dx.
Equals Integral_{x=0..1} (1/(1-x) + 1/log(x)) dx = Integral_{x=0..1} (1/x + 1/log(1-x)) dx.
Equals -Integral_{-oo..oo} x*exp(x-exp(x)) dx.
Equals Sum_{k>=1} (-1)^k * floor(log_2(k))/k.
Equals (-1/2) * Sum_{k>=1} (Lambda(k)-1)/k, where Lambda is the Mangoldt function. (End)
Equals Integral_{0..1} -1/LambertW(-1,-x*exp(-x)) dx = 1 + Integral_{0..1} LambertW(-1/x*exp(-1/x)) dx. - Gleb Koloskov, Jun 12 2021
Equals Sum_{k>=2} (-1)^k * zeta(k)/k. - Vaclav Kotesovec, Jun 19 2021
Equals lim_{x->oo} log(x) - Sum_{p prime <= x} log(p)/(p-1). - Amiram Eldar, Jun 29 2021
Limit_{n->oo} (2*HarmonicNumber(n) - HarmonicNumber(n^2)). After answer by Eric Naslund on Mathematics Stack Exchange, on Jun 21 2011. - Mats Granvik, Jul 19 2021
Equals Integral_{x=0..oo} ( exp(-x) * (1/(1-exp(-x)) - 1/x) ) dx (see Gugger or Monier). - Bernard Schott, Nov 21 2021
Equals 1/2 + Limit_{s->1} (Zeta(s) + Zeta(1/s))/2. - Thomas Ordowski, Jan 12 2023
Equals Sum_{j>=2} Sum_{k>=2} ((k-1)/(k*j^k)). - Mike Tryczak, Apr 06 2023
From Stefano Spezia, Oct 27 2024: (Start)
Equals Sum_{n>=1} n*(zeta(n+1) - 1)/(n + 1) [Euler] (see Finch at p. 30).
Equals lim_{n->oo} Sum_{prime p<=n} log(p/(p - 1)) - log(log(n)) (see Finch at p. 31). (End)
Equals lim_{s->1} zeta(s) - zeta(s)^2/zeta(2*s - 1)/2. - Mats Granvik, Jul 07 2025

A053657 a(n) = Product_{p prime} p^{ Sum_{k>=0} floor[(n-1)/((p-1)p^k)]}.

Original entry on oeis.org

1, 2, 24, 48, 5760, 11520, 2903040, 5806080, 1393459200, 2786918400, 367873228800, 735746457600, 24103053950976000, 48206107901952000, 578473294823424000, 1156946589646848000, 9440684171518279680000, 18881368343036559360000, 271211974879377138647040000
Offset: 1

Views

Author

Jean-Luc Chabert, Feb 16 2000

Keywords

Comments

LCM of denominators of the coefficients of x^n*z^k in {-log(1-x)/x}^z as k=0..n, as described by triangle A075264.
Denominators of integer-valued polynomials on prime numbers (with degree n): 1/a(n) is a generator of the ideal formed by the leading coefficients of integer-valued polynomials on prime numbers with degree less than or equal to n.
Also the least common multiple of the orders of all finite subgroups of GL_n(Q) [Minkowski]. Schur's notation for the sequence is M_n = a(n+1). - Martin Lorenz (lorenz(AT)math.temple.edu), May 18 2005
This sequence also occurs in algebraic topology where it gives the denominators of the Laurent polynomials forming a regular basis for K*K, the hopf algebroid of stable cooperations for complex K-theory. Several different equivalent formulas for the terms of the sequence occur in the literature. An early reference is K. Johnson, Illinois J. Math. 28(1), 1984, pp.57-63 where it occurs in lines 1-5, page 58. A summary of some of the other formulas is given in the appendix to K. Johnson, Jour. of K-theory 2(1), 2008, 123-145. - Keith Johnson (johnson(AT)mscs.dal.ca), Nov 03 2008
a(n) is divisible by n!, by Legendre's formula for the highest power of a prime that divides n!. Also, a(n) is divisible by (n+1)! if and only if n+1 is not prime. - Jonathan Sondow, Jul 23 2009
Triangle A163940 is related to the divergent series 1^m*1! - 2^m*2! + 3^m*3! - 4^m*4! + ... for m =>-1. The left hand columns of this triangle can be generated with the MC polynomials, see A163972. The Minkowski numbers appear in the denominators of these polynomials. - Johannes W. Meijer, Oct 16 2009
Unsigned Stirling numbers of the first kind as [s + k, k] (Karamata's notation) where k = {0, 1, 2, ...} and s is in general complex results in Pochhammer[s,k]*(integer coefficient polynomial of (k-1) degree in s) / M[k], where M[k] is the least common multiple of the orders of all finite groups of n x n-matrices over rational numbers (Minkowiski's theorem) which is sequence A053657. - Lorenz H. Menke, Jr., Feb 02 2010
From Peter Bala, Feb 21 2011: (Start)
Given a subset S of the integers Z, Bhargava has shown how to associate with S a generalized factorial function, denoted n!_S, which shares many properties of the classical factorial function n!.
The present sequence is the generalized factorial function n!S associated with the set of primes S = {2,3,5,7,...}. The associated generalized exponential function E(x) = Sum{n>=1} x^(n-1)/a(n) vanishes at x = -2: i.e. Sum_{n>=1} (-2)^n/a(n) = 0.
For the table of associated generalized binomial coefficients n!_S/(k!_S*(n-k)!_S) see A186430.
This sequence is related to the Bernoulli polynomials in two ways [Chabert and Cahen]:
(1) a(n) = (n-1)!*A001898(n-1).
(2) (t/(exp(t)-1))^x = sum {n = 0..inf} P(n,x)*t^n/a(n+1),
where the P(n,x) are primitive polynomials in the ring Z[x].
If p_1,...,p_n are any n primes then the product of their pairwise differences Product_{i
(End)
LCM of denominators of the coefficients of S(m+n-1,m) as polynomial in m of degree 2*(n-1), as described by triangle A202339. - Vladimir Shevelev, Dec 17 2011
Sometimes called "Minkowski numbers" (e.g., by Guralnick and Lorenz), after the German mathematician Hermann Minkowski (1864-1909). - Amiram Eldar, Aug 24 2024

Examples

			a(7)=24^3*Product_{i=1..3} A202318(i)=24^3*1*10*21=2903040. - _Vladimir Shevelev_, Dec 17 2011
		

References

  • Jean-Luc Chabert, Scott T. Chapman, and William W. Smith, A basis for the ring of polynomials integer-valued on prime numbers, in: Daniel Anderson (ed.), Factorization in integral domains, Lecture Notes in Pure and Appl. Math. 189, Dekker, New York, 1997.

Crossrefs

a(n) = n!*A163176(n). - Jonathan Sondow, Jul 23 2009
Cf. A202318.
Appears in A163972. - Johannes W. Meijer, Oct 16 2009

Programs

  • Maple
    A053657 := proc(n) local P,p,q,s,r;
    P := select(isprime,[$2..n]); r:=1;
    for p in P do s := 0; q := p-1;
    do if q > (n-1) then break fi;
    s := s + iquo(n-1,q); q := q*p; od;
    r := r * p^s; od; r end: # Peter Luschny, Jul 26 2009
    ser := series((y/(exp(y)-1))^x, y, 20): a := n -> denom(coeff(ser, y, n-1)):
    seq(a(n), n=1..19); # Peter Luschny, May 13 2019
  • Mathematica
    m = 16; s = Expand[Normal[Series[(-Log[1-x]/x)^z, {x, 0, m}]]];
    a[n_, k_] := Denominator[ Coefficient[s, x^n*z^k]];
    Prepend[Apply[LCM, Table[a[n,k], {n,m}, {k,n}], {1}], 1]
    (* Jean-François Alcover, May 31 2011 *)
    a[n_] := Product[p^Sum[Floor[(n-1)/((p-1) p^k)], {k, 0, n}], {p, Prime[ Range[n] ]}]; Array[a, 30] (* Jean-François Alcover, Nov 22 2016 *)
  • PARI
    {a(n)=local(X=x+x^2*O(x^n),D);D=1;for(j=0,n-1,D=lcm(D,denominator( polcoeff(polcoeff((-log(1-X)/x)^z+z*O(z^j),j,z),n-1,x))));return(D)} /* Paul D. Hanna, Jun 27 2005 */
    
  • PARI
    {a(n)=prod(i=1,#factor(n!)~,prime(i)^sum(k=0,#binary(n), floor((n-1)/((prime(i)-1)*prime(i)^k))))} /* Paul D. Hanna, Jun 27 2005 */
    
  • PARI
    S(n, p) = {
         my(acc = 0, tmp = p-1);
         while (tmp < n, acc += floor((n-1)/tmp); tmp *= p);
         return(acc);
    };
    a(n) = {
         my(rv = 1);
         forprime(p = 2, n, rv *= p^S(n,p));
         return(rv);
    };
    vector(17, i, a(i))  \\ Gheorghe Coserea, Aug 24 2015

Formula

a(2n) = 2*a(2n-1). - Jonathan Sondow, Jul 23 2009
a(2*n+1) = 24^n * Product_{i=1..n} A202318(i). - Vladimir Shevelev, Dec 17 2011
For n>=0, A007814(a(n+1)) = n+A007814(n!). - Vladimir Shevelev, Dec 28 2011
a(n) = denominator([y^(n-1)] (y/(exp(y)-1))^x). - Peter Luschny, May 13 2019
Sum_{n>=1} 1/a(n) = A346046. - Amiram Eldar, Jul 02 2023

Extensions

More terms from Paul D. Hanna, Jun 27 2005

A002657 Numerators of Cauchy numbers of second type (= Bernoulli numbers B_n^{(n)}).

Original entry on oeis.org

1, 1, 5, 9, 251, 475, 19087, 36799, 1070017, 2082753, 134211265, 262747265, 703604254357, 1382741929621, 8164168737599, 5362709743125, 8092989203533249, 15980174332775873, 12600467236042756559
Offset: 0

Keywords

Comments

These coefficients (with alternating signs) are also known as the Nørlund [or Norlund, Noerlund or Nörlund] numbers. [After the Danish mathematician Niels Erik Nørlund (1885-1981). - Amiram Eldar, Jun 17 2021]
The denominators are found in A002790. The alternating rational sequence ((-1)^n)*a(n)/A002790(n)is the z-sequence for the Stirling2 triangle A008277(n+1,k+1), n>=k>=0. This is the Sheffer (exp(x),exp(x)-1) triangle. See the W. Lang link under A006232 for Sheffer a- and z-sequences with references, and the conversion to S. Roman's notation. The a-sequence is A006232(n)/A006233(n). - Wolfdieter Lang, Oct 06 2011 [This is the Sheffer triangle A007318*A048993. Added Jun 20 2017]
A simple series with the signless Cauchy numbers of second type C2(n) leads to Euler's constant: gamma = 1 - Sum_{n >=1} C2(n)/(n*(n+1)!) = 1 - 1/4 - 5/72 - 1/32 - 251/14400 - 19/1728 - 19087/2540160 - ..., see references [Blagouchine] below, as well as A075266 and A262235. - Iaroslav V. Blagouchine, Sep 15 2015

Examples

			1, 1/2, 5/6, 9/4, 251/30, 475/12, 19087/84, 36799/24, 1070017/90, ...
		

References

  • Louis Comtet, Advanced Combinatorics, Reidel, 1974, p. 294.
  • P. Curtz, Intégration numérique des systèmes différentiels à conditions initiales, Centre de Calcul Scientifique de l'Armement, Arcueil, 1969.
  • Louis Melville Milne-Thompson, Calculus of Finite Differences, 1951, p. 136.
  • N. E. Nørlund, Vorlesungen über Differenzenrechnung, Springer-Verlag, Berlin, 1924.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Programs

  • Magma
    m:=25; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(-x/((1-x)*Log(1-x)) )); [Numerator(Factorial(n-1)*b[n]): n in [1..m-1]]; // G. C. Greubel, Oct 29 2018
  • Maple
    seq(numer(add((-1)^(n-k)*Stirling1(n,k)/(k+1),k=0..n)),n=0..10); # Peter Luschny, Apr 28 2009
  • Mathematica
    Table[Abs[Numerator[NorlundB[n,n]]],{n,0,30}](* Vladimir Joseph Stephan Orlovsky, Dec 30 2010 *)
    a[ n_] := If[ n < 0, 0, (-1)^n Numerator @ NorlundB[ n, n]]; (* Michael Somos, Jul 12 2014 *)
    a[ n_] := If[ n < 0, 0, Numerator@Integrate[ Pochhammer[ x, n], {x, 0, 1}]]; (* Michael Somos, Jul 12 2014 *)
    a[ n_] := If[ n < 0, 0, Numerator[ n! SeriesCoefficient[ -x / ((1 - x) Log[ 1 - x]), {x, 0, n}]]]; (* Michael Somos, Jul 12 2014 *)
    a[ n_] := If[ n < 0, 0, (-1)^n Numerator[ n! SeriesCoefficient[ (x / (Exp[x] - 1))^n, {x, 0, n}]]]; (* Michael Somos, Jul 12 2014 *)
  • Maxima
    v(n):=if n=0 then 1 else 1-sum(v(i)/(n-i+1),i,0,n-1);
    makelist(num(n!*v(n)),n,0,10); /* Vladimir Kruchinin, Aug 28 2013 */
    

Formula

Numerator of integral of x(x+1)...(x+n-1) from 0 to 1.
E.g.f.: -x/((1-x)*log(1-x)). (Note: the numerator of the coefficient of x^n/n! is a(n). - Michael Somos, Jul 12 2014). E.g.f. rewritten by Iaroslav V. Blagouchine, May 07 2016
Numerator of Sum_{k=0..n} (-1)^(n-k) A008275(n,k)/(k+1). - Peter Luschny, Apr 28 2009
a(n) = numerator(n!*v(n)), where v(n) = 1 - Sum_{i=0..n-1} v(i)/(n-i+1), v(0)=1. - Vladimir Kruchinin, Aug 28 2013

A002790 Denominators of Cauchy numbers of second type (= Bernoulli numbers B_n^{(n)}).

Original entry on oeis.org

1, 2, 6, 4, 30, 12, 84, 24, 90, 20, 132, 24, 5460, 840, 360, 16, 1530, 180, 7980, 840, 13860, 440, 1656, 720, 81900, 6552, 216, 112, 3480, 240, 114576, 7392, 117810, 2380, 1260, 72, 3838380, 207480, 32760, 560, 568260, 27720, 238392, 55440, 869400, 2576, 236880
Offset: 0

Keywords

Comments

The numerators are given in A002657.
These coefficients (with alternating signs) are also known as the Nørlund [or Norlund, Noerlund or Nörlund] numbers.
A simple series with the signless Cauchy numbers of second type C2(n) leads to Euler's constant: gamma = 1 - Sum_{n >=1} C2(n)/(n*(n+1)!) = 1 - 1/4 - 5/72 - 1/32 - 251/14400 - 19/1728 - 19087/2540160 - ..., see references [Blagouchine] below, as well as A075266 and A262235. - Iaroslav V. Blagouchine, Sep 15 2015
a(n) appears to be divisible by n+1. - Hal M. Switkay, Aug 15 2025

Examples

			1, 1/2, 5/6, 9/4, 251/30, 475/12, 19087/84, 36799/24, 1070017/90, ...
		

References

  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 294.
  • L. M. Milne-Thompson, Calculus of Finite Differences, 1951, p. 136.
  • N. E. Nørlund, Vorlesungen über Differenzenrechnung, Springer-Verlag, Berlin, 1924.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Programs

  • Magma
    m:=60; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(-x/((1-x)*Log(1-x)) )); [Denominator(Factorial(n-1)*b[n]): n in [1..m-1]]; // G. C. Greubel, Oct 28 2018
  • Maple
    A002790 := proc(n)
        denom(add((-1)^k*Stirling1(n, k)/(k+1), k=0..n)) ;
    end proc: # Peter Luschny, Apr 28 2009
    v := proc(n) option remember; ifelse(n=0, 1, 1 - add(v(i)/(n-i+1), i=0..n-1)) end:
    seq(denom(n!*v(n)), n = 0..46); # after Vladimir Kruchinin, Peter Luschny, Aug 17 2025
  • Mathematica
    Table[ Denominator[ NorlundB[n, n]], {n, 0, 60}] (* Vladimir Joseph Stephan Orlovsky, Dec 30 2010 *)
  • Maxima
    v(n):=if n=0 then 1 else 1-sum(v(i)/(n-i+1),i,0,n-1);
    makelist(denom(n!*v(n)),n,0,10); /* Vladimir Kruchinin, Aug 28 2013 */
    

Formula

Denominator of integral of x(x+1)...(x+n-1) from 0 to 1.
E.g.f.: -x/((1-x)*log(1-x)). - Corrected by Iaroslav V. Blagouchine, May 07 2016.
Denominator of Sum_{k=0..n} (-1)^k A008275(n,k)/(k+1). - Peter Luschny, Apr 28 2009
a(n) = denominator(n!*v(n)), where v(n) = 1 - Sum_{i=0..n-1} v(i)/(n-i+1), v(0)=1. - Vladimir Kruchinin, Aug 28 2013

A262235 Denominators of a series leading to Euler's constant gamma.

Original entry on oeis.org

4, 72, 32, 14400, 1728, 2540160, 138240, 261273600, 896000, 10538035200, 209018880, 407994402816000, 5633058816000, 941525544960000, 4723310592, 8707228239790080000, 6162712657920000, 17473102222724628480000, 107559878256230400000, 14162409169997856768000000
Offset: 1

Author

Keywords

Comments

Gamma = 1 - 1/4 - 5/72 - 1/32 - 251/14400 - 19/1728 - 19087/2540160 - ..., see the references below.

Examples

			Denominators of 1/4, 5/72, 1/32, 251/14400, 19/1728, 19087/2540160, ...
		

Programs

  • Maple
    a := proc(n) local r; r := proc(n) option remember; if n=0 then 1 else
    1 - add(r(k)/(n-k+1), k=0..n-1) fi end: denom(r(n)/(n*(n+1))) end:
    seq(a(n), n=1..20); # Peter Luschny, Apr 19 2018
  • Mathematica
    g[n_] := Sum[Abs[StirlingS1[n, l]]/(l + 1), {l, 1, n}]/(n*(n + 1)!); a[n_] := Denominator[g[n]]; Table[a[n], {n, 1, 20}]

Formula

a(n) = C2(n)/(n*(n + 1)!), where C2(n) are Cauchy numbers of the second kind (see A002657 and A002790).

A075267 Denominator of the coefficient of x^n in log(-log(1-x)/x).

Original entry on oeis.org

2, 24, 8, 2880, 288, 362880, 17280, 29030400, 89600, 958003200, 17418240, 31384184832000, 402361344000, 62768369664000, 295206912, 512189896458240000, 342372925440000, 919636959090769920000, 5377993912811520000, 674400436666564608000000, 89903156428800000
Offset: 1

Author

Paul D. Hanna, Sep 15 2002

Keywords

Crossrefs

Cf. A075266 (numerator), A075264, A053657.

Programs

  • Magma
    m:=25; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!( Log(-Log(1-x)/x) )); [Denominator(b[n]): n in [1..m-2]]; // G. C. Greubel, Oct 29 2018
  • Maple
    S:= series(log(-log(1-x)/x),x,51):
    seq(denom(coeff(S,x,j)),j=1..50); # Robert Israel, May 17 2016
  • Mathematica
    Denominator[ CoefficientList[ Series[ Log[ -Log[1 - x]/x], {x, 0, 18}], x]]

Formula

a(n) = denominator(Sum_{k=1..n} (k-1)!*(-1)^(n-k-1)*binomial(n,k)*Stirling1(n+k,k)/(n+k)!). - Vladimir Kruchinin, Aug 14 2025

Extensions

Edited by Robert G. Wilson v, Sep 17 2002

A262382 Numerators of a semi-convergent series leading to the first Stieltjes constant gamma_1.

Original entry on oeis.org

-1, 11, -137, 121, -7129, 57844301, -1145993, 4325053069, -1848652896341, 48069674759189, -1464950131199, 105020512675255609, -22404210159235777, 1060366791013567384441, -15899753637685210768473787, 2241672100026760127622163469, -8138835628210212414423299
Offset: 1

Author

Keywords

Comments

gamma_1 = - 1/12 + 11/720 - 137/15120 + 121/11200 - 7129/332640 + 57844301/908107200 - ..., see formulas (46)-(47) in the reference below.

Examples

			Numerators of -1/12, 11/720, -137/15120, 121/11200, -7129/332640, 57844301/908107200, ...
		

Crossrefs

Cf. A001620, A002206, A195189, A075266, A262235, A001067, A006953, A082633, A262383 (denominators of this series), A086279, A086280, A262387.

Programs

  • Maple
    a := n -> numer(Zeta(1 - 2*n)*(Psi(2*n) + gamma)):
    seq(a(n), n=1..16); # Peter Luschny, Apr 19 2018
  • Mathematica
    a[n_] := Numerator[-BernoulliB[2*n]*HarmonicNumber[2*n - 1]/(2*n)]; Table[a[n], {n, 1, 20}]
  • PARI
    a(n) = numerator(-bernfrac(2*n)*sum(k=1,2*n-1,1/k)/(2*n)); \\ Michel Marcus, Sep 23 2015

Formula

a(n) = numerator(-B_{2n}*H_{2n-1}/(2n)), where B_n and H_n are Bernoulli and harmonic numbers respectively.
a(n) = numerator(Zeta(1 - 2*n)*(Psi(2*n) + gamma)), where gamma is Euler's gamma. - Peter Luschny, Apr 19 2018

A262383 Denominators of a semi-convergent series leading to the first Stieltjes constant gamma_1.

Original entry on oeis.org

12, 720, 15120, 11200, 332640, 908107200, 4324320, 2940537600, 175991175360, 512143632000, 1427794368, 7795757249280, 107084577600, 279490747536000, 200143324310529600, 1178332991611776000, 157531148611200, 906996615309386784000, 5828652498614400, 262872227687509440000
Offset: 1

Author

Keywords

Comments

gamma_1 = - 1/12 + 11/720 - 137/15120 + 121/11200 - 7129/332640 + 57844301/908107200 - ..., see formulas (46)-(47) in the reference below.

Examples

			Denominators of -1/12, 11/720, -137/15120, 121/11200, -7129/332640, 57844301/908107200, ...
		

Crossrefs

Programs

  • Maple
    a := n -> denom(Zeta(1 - 2*n)*(Psi(2*n) + gamma)):
    seq(a(n), n=1..20); # Peter Luschny, Apr 19 2018
  • Mathematica
    a[n_] := Denominator[-BernoulliB[2*n]*HarmonicNumber[2*n - 1]/(2*n)]; Table[a[n], {n, 1, 20}]
  • PARI
    a(n) = denominator(-bernfrac(2*n)*sum(k=1,2*n-1,1/k)/(2*n)); \\ Michel Marcus, Sep 23 2015

Formula

a(n) = denominator(-B_{2n}*H_{2n-1}/(2n)), where B_n and H_n are Bernoulli and harmonic numbers respectively.
a(n) = denominator(Zeta(1 - 2*n)*(Psi(2*n) + gamma)), where gamma is Euler's gamma. - Peter Luschny, Apr 19 2018

A262387 Denominators of a semi-convergent series leading to the third Stieltjes constant gamma_3.

Original entry on oeis.org

1, 120, 1008, 28800, 49896, 101088000, 5702400, 12350257920000, 43480172736000, 7075668600000, 206069667148800, 5919216795588096000, 581222138112000, 8460252005694128640000, 18991807088644406016000, 1150594272774401495040000, 33940540399314092544000, 9737059611553100811150566400000, 1290633707289706940160000, 1263402804161736165764268432000000
Offset: 1

Author

Keywords

Comments

gamma_3 = + 1/120 - 17/1008 + 967/28800 - 4523/49896 + 33735311/101088000 - ..., see formulas (46)-(47) in the reference below.

Examples

			Denominators of -0/1, 1/120, -17/1008, 967/28800, -4523/49896, 33735311/101088000, ...
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Denominator[-BernoulliB[2*n]*(HarmonicNumber[2*n - 1]^3 - 3*HarmonicNumber[2*n - 1]*HarmonicNumber[2*n - 1, 2] + 2*HarmonicNumber[2*n - 1, 3])/(2*n)]; Table[a[n], {n, 1, 20}]
  • PARI
    a(n) = denominator(-bernfrac(2*n)*(sum(k=1,2*n-1,1/k)^3 -3*sum(k=1,2*n-1,1/k)*sum(k=1,2*n-1,1/k^2) + 2*sum(k=1,2*n-1,1/k^3))/(2*n));

Formula

a(n) = denominator(-B_{2n}*(H^3_{2n-1}-3*H_{2n-1}*H^(2){2n-1}+2*H^(3){2n-1})/(2n)), where B_n, H_n and H^(k)_n are Bernoulli, harmonic and generalized harmonic numbers respectively.

A301816 Decimal expansion of the real Stieltjes gamma function at x = 1/2.

Original entry on oeis.org

2, 7, 5, 4, 3, 4, 7, 2, 4, 5, 6, 3, 9, 2, 0, 0, 7, 9, 9, 5, 5, 2, 8, 7, 8, 7, 7, 7, 9, 7, 8, 0, 6, 8, 3, 5, 7, 9, 8, 7, 0, 2, 3, 2, 3, 8, 8, 6, 3, 0, 7, 4, 8, 7, 3, 7, 3, 3, 2, 1, 1, 4, 7, 5, 1, 3, 3, 0, 6, 3, 4, 4, 1, 7, 3, 0, 6, 4, 6, 8, 8, 2, 2, 3, 5, 9, 2
Offset: 0

Author

Peter Luschny, Apr 09 2018

Keywords

Comments

Define the real Stieltjes gamma function (this is not a standard notion) as Sti(x) = -2*Pi*I(x+1)/(x+1) where I(x) = Integral_{-infinity..+infinity} log(1/2+i*z)^x/(exp(-Pi*z) + exp(Pi*z))^2 dz and i is the imaginary unit. We look here at the real part of Sti(x).

Examples

			0.2754347245639200799552878777978068357987023238863074873733211475133063441...
		

Crossrefs

Sti(0) = A001620 (Euler's constant gamma) (cf. A262235/A075266),
Sti(1/2) = A301816,
Sti(1) = A082633 (Stieltjes constant gamma_1) (cf. A262382/A262383),
Sti(3/2) = A301817,
Sti(2) = A086279 (Stieltjes constant gamma_2) (cf. A262384/A262385),
Sti(3) = A086280 (Stieltjes constant gamma_3) (cf. A262386/A262387),
Sti(4) = A086281, Sti(5) = A086282, Sti(6) = A183141, Sti(7) = A183167,
Sti(8) = A183206, Sti(9) = A184853, Sti(10) = A184854.

Programs

  • Maple
    Sti := x -> (-4*Pi/(x + 1))*int(log(1/2 + I*z)^(x + 1)/(exp(-Pi*z) + exp(Pi*z))^2, z=0..64): Sti(1/2): Re(evalf(%, 100)); # Note that this is an approximation which needs a larger domain of integration and higher precision if used for more values than are in the Data section.

Formula

c = -Re((4/3)*Pi*Integral_{-oo..oo} log(1/2+i*z)^(3/2)/(exp(-Pi*z)+exp(Pi*z))^2 dz).
Showing 1-10 of 15 results. Next