A000367 -id:A000367 - cp's OEIS frontend

A051716 Numerators of Bernoulli twin numbers C(n).

1, -1, -1, -1, -1, 1, 1, -1, -1, 1, 5, -5, -691, 691, 7, -7, -3617, 3617, 43867, -43867, -174611, 174611, 854513, -854513, -236364091, 236364091, 8553103, -8553103, -23749461029, 23749461029, 8615841276005, -8615841276005, -7709321041217, 7709321041217, 2577687858367

Offset: 0

N. J. A. Sloane

The Bernoulli twin numbers C(n) are defined by C(0) = 1, then C(2n) = B(2n) + B(2n-1), C(2n+1) = -B(2n+1) - B(2n), where B() are the Bernoulli numbers A027641/A027642. The definition is due to Paul Curtz.
For denominators see A051717.
Negatives of numerators of column 1 of table described in A051714/A051715.

			The C(n) sequence is 1, -1/2, -1/3, -1/6, -1/30, 1/30, 1/42, -1/42, -1/30, 1/30, 5/66, -5/66, -691/2730, 691/2730, 7/6, -7/6, ...

Vincenzo Librandi, Table of n, a(n) for n = 0..640
M. Kaneko, The Akiyama-Tanigawa algorithm for Bernoulli numbers, J. Integer Sequences, 3 (2000), #00.2.9.

Cf. A000367, A027641, A027642, A051714, A051715.

Cf. A051717, A129825, A129826, A129724, A164555.

f:= func< n | Bernoulli(n) + Bernoulli(n-1) >;
function A051716(n)
  if n eq 0 then return 1;
  elif (n mod 2) eq 0 then return Numerator(f(n));
  else return Numerator(-f(n));
  end if;
end function;
[A051716(n): n in [0..50]]; // G. C. Greubel, Apr 22 2023

C:=proc(n) if n=0 then RETURN(1); fi; if n mod 2 = 0 then RETURN(bernoulli(n)+bernoulli(n-1)); else RETURN(-bernoulli(n)-bernoulli(n-1)); fi; end;

c[0]= 1; c[n_?EvenQ]:= BernoulliB[n] + BernoulliB[n-1]; c[n_?OddQ]:= -BernoulliB[n] - BernoulliB[n-1]; Table[Numerator[c[n]], {n,0,34}] (* Jean-François Alcover, Dec 19 2011 *)

a(n) = if (n==0, 1, nu = numerator(bernfrac(n)+bernfrac(n-1)); if (n%2, -nu, nu)); \\ Michel Marcus, Jan 29 2017

def f(n): return bernoulli(n)+bernoulli(n-1)
def A051716(n):
    if (n==0): return 1
    elif (n%2==0): return numerator(f(n))
    else: return numerator(-f(n))
[A051716(n) for n in range(51)] # G. C. Greubel, Apr 22 2023

Numerators of differences of the sequence of rational numbers 0 followed by A164555/A027642. - Paul Curtz, Jan 29 2017

The e.g.f. of the rationals a(n)/A051717(n) is -(1/x + x^2/2 + x/(1 - exp(x)) + dilog(exp(-x))), (with dilog(x) = polylog(2, 1-x)). From integrating the e.g.f. of the z-sequence (exp(x) - (1+x))/(exp(x) -1)^2 for the Bernoulli polynomials of the second kind (A290317 / A290318). - Wolfdieter Lang, Aug 07 2017

More terms from James Sellers, Dec 08 1999

Edited by N. J. A. Sloane, May 25 2008

A006954 Denominators of Bernoulli numbers B_0, B_1, B_2, B_4, B_6, ...

Original entry on oeis.org

1, 2, 6, 30, 42, 30, 66, 2730, 6, 510, 798, 330, 138, 2730, 6, 870, 14322, 510, 6, 1919190, 6, 13530, 1806, 690, 282, 46410, 66, 1590, 798, 870, 354, 56786730, 6, 510, 64722, 30, 4686, 140100870, 6, 30, 3318, 230010, 498, 3404310, 6, 61410, 272118, 1410, 6, 4501770

Offset: 0

N. J. A. Sloane, Simon Plouffe

These are the denominators if you hurriedly look down a list of the nonzero Bernoulli numbers without noticing that B_1 has been included.

From the von Staudt-Clausen theorem, denominator(B_2n) = product of primes p such that (p-1)|2n.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 260.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.6.1, p. 41.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Th. 118.
H. Rademacher, Topics in Analytic Number Theory, Springer, 1973, Chap. 1.
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).

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 260.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Index entries for sequences related to Bernoulli numbers.

Cf. A000367, A002445, A027762.

Join[{1,2},Denominator[BernoulliB[Range[2,100,2]]]] (* Harvey P. Dale, Apr 11 2016 *)

E.g.f: t/(e^t - 1).

More terms from T. D. Noe, Mar 31 2004

A051715 Denominators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)(a(n,k)-a(n,k+1)), n >= 0, k >= 0.

Original entry on oeis.org

1, 2, 2, 3, 3, 6, 4, 4, 6, 1, 5, 5, 20, 30, 30, 6, 6, 15, 20, 30, 1, 7, 7, 42, 35, 140, 42, 42, 8, 8, 28, 84, 105, 28, 42, 1, 9, 9, 72, 84, 1, 105, 140, 30, 30, 10, 10, 45, 120, 140, 28, 105, 20, 30, 1, 11, 11, 110, 495, 3960, 924, 231, 165, 220, 66, 66, 12, 12, 66, 55, 495, 264, 308, 132, 165, 44, 66, 1

Offset: 0

N. J. A. Sloane

Leading column gives the Bernoulli numbers A027641/A027642.

			Table begins:
    1    1/2   1/3    1/4   1/5  1/6  1/7 ...
   1/2   1/3   1/4    1/5   1/6  1/7 ...
   1/6   1/6   3/20   2/15  5/42 ...
    0    1/30  1/20   2/35  5/84 ...
  -1/30 -1/30 -3/140 -1/105 ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
M. Kaneko, The Akiyama-Tanigawa algorithm for Bernoulli numbers, J. Integer Sequences, 3 (2000), #00.2.9.
Index entries for sequences related to Bernoulli numbers.

Rows 2, 3, 4 give A026741/A045896, A051712/A051713, A051722/A051723.
Columns 0, 1, 2, 3 give A000367/A002445, A051716/A051717, A051718/A051719, A051720/A051721.
Numerators are in A051714.

a:= proc(n,k) option remember;
      `if`(n=0, 1/(k+1), (k+1)*(a(n-1,k)-a(n-1,k+1)))
    end:
seq(seq(denom(a(n, d-n)), n=0..d), d=0..12); # Alois P. Heinz, Apr 17 2013

nmax = 12; a[0, k_] := 1/(k+1); a[n_, k_] := a[n, k] = (k+1)(a[n-1, k]-a[n-1, k+1]); Denominator[ Flatten[ Table[ a[n-k, k], {n, 0, nmax}, {k, n, 0, -1}]]](* Jean-François Alcover, Nov 28 2011 *)

a(n,k) = denominator(Sum_{j=0..n} (-1)^(n-j)*j!*Stirling2(n,j)/(j+k+1)). - Fabián Pereyra, Jan 14 2023

More terms from James Sellers, Dec 08 1999

A006863 Denominator of B_{2n}/(-4n), where B_m are the Bernoulli numbers.

Original entry on oeis.org

1, 24, 240, 504, 480, 264, 65520, 24, 16320, 28728, 13200, 552, 131040, 24, 6960, 171864, 32640, 24, 138181680, 24, 1082400, 151704, 5520, 1128, 4455360, 264, 12720, 86184, 13920, 1416, 6814407600, 24

Offset: 0

N. J. A. Sloane, Jeffrey Shallit, Simon Plouffe

Carmichael defines lambda(n) to be the exponent of the group U(n) of units of the integers mod n. He shows that given m there is a number lambda^*(m) such that lambda(n) divides m if and only if n divides lambda^*(m). He gives a formula for lambda^*(m), equivalent to the one I've quoted for even m. (We have lambda^*(m)=2 for any odd m.) The present sequence gives the values of lambda^*(2m) for positive integers m. - Peter J. Cameron, Mar 25 2002
(-1)^n*B_{2n}/(-4n) = Integral_{t>=0} t^(2n-1)/(exp(2*Pi*t) - 1)dt. - Benoit Cloitre, Apr 04 2002
Michael Lugo (see link) conjectures, and Peter McNamara proves, that a(n) = gcd_{ primes p > 2n+1 } (p^(2n) - 1). - Tanya Khovanova, Feb 21 2009 [edited by Charles R Greathouse IV, Dec 03 2014]

Bruce Berndt, Ramanujan's Notebooks Part II, Springer-Verlag; see Integrals and Asymptotic Expansions, p. 220.
F. Hirzebruch et al., Manifolds and Modular Forms, Vieweg, 2nd ed. 1994, p. 130.
J. W. Milnor and J. D. Stasheff, Characteristic Classes, Princeton, 1974, p. 286.
Douglas C. Ravenel, Complex cobordism theory for number theorists, Lecture Notes in Mathematics, 1326, Springer-Verlag, Berlin-New York, 1988, pp. 123-133.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. C. Vaughan and T. D. Wooley, Waring's problem: a survey, pp. 285-324 of Surveys in Number Theory (Urbana, May 21, 2000), ed. M. A. Bennett et al., Peters, 2003. (The function K(2n), see p. 303.)

T. D. Noe, Table of n, a(n) for n = 0..10000
P. J. Cameron and D. A. Preece, Notes on primitive lambda-roots
R. D. Carmichael, Note on a new number theory function, Bull. Amer. Math. Soc. 16 (1909-10), 232-238.
G. Everest, Y. Puri and T. Ward, Integer sequences counting periodic points, arXiv:math/0204173 [math.NT], 2002.
Michael Lugo, A little number theory problem (2008)
Eric Weisstein's World of Mathematics, Eisenstein Series.
Index entries for sequences related to Bernoulli numbers.

Numerators are A001067.

Cf. A000367/A002445, A002322, A079612.

Concatenation([1], List([1..35], n-> DenominatorRat(Bernoulli(2*n)/(-4*n)) )); # G. C. Greubel, Sep 19 2019

[1] cat [Denominator(Bernoulli(2*n)/(-4*n)):n in [1..35]]; // G. C. Greubel, Sep 19 2019

1,seq(denom(bernoulli(2*n)/(-4*n)), n=1 .. 100); # Robert Israel, Dec 03 2014

a[n_] := Denominator[BernoulliB[2n]/(-4n)]; Table[a[n], {n, 0, 31}] (* Jean-François Alcover, Mar 20 2011 *)

a(n) = if (n == 0, 1, denominator(bernfrac(2*n)/(-4*n))); \\ Michel Marcus, Sep 10 2013

[1]+[denominator(bernoulli(2*n)/(-4*n)) for n in (1..35)] # G. C. Greubel, Sep 19 2019

B_{2k}/(4k) = -(1/2)*zeta(1-2k). For n > 0, a(n) = gcd k^L (k^{2n}-1) where k ranges over all the integers and L is as large as necessary.

Product of 2^{a+2} (where 2^a exactly divides 2*n) and p^{a+1} (where p is an odd prime such that p-1 divides 2*n and p^a exactly divides 2*n). - Peter J. Cameron, Mar 25 2002

Thanks to Michael Somos for helpful comments.

A155100 Triangle read by rows: coefficients in polynomials P_n(u) arising from the expansion of D^(n-1) (tan x) in increasing powers of tan x for n>=1 and 1 for n=0.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 0, 2, 0, 2, 2, 0, 8, 0, 6, 0, 16, 0, 40, 0, 24, 16, 0, 136, 0, 240, 0, 120, 0, 272, 0, 1232, 0, 1680, 0, 720, 272, 0, 3968, 0, 12096, 0, 13440, 0, 5040, 0, 7936, 0, 56320, 0, 129024, 0, 120960, 0, 40320, 7936, 0, 176896, 0, 814080, 0, 1491840

Offset: 0

N. J. A. Sloane, Nov 05 2009

The definition is d^(n-1) tan x / dx^n = P_n(tan x) for n>=1 and 1 for n=0.
Interpolates between factorials and tangent numbers.
From Peter Bala, Mar 02 2011: (Start)
Companion triangles are A104035 and A185896.
A combinatorial interpretation for the polynomial P_n(t) as the generating function for a sign change statistic on certain types of signed permutation can be found in [Verges].
A signed permutation is a sequence (x_1,x_2,...,x_n) of integers such that {|x_1|,|x_2|,...,|x_n|} = {1,2,...,n}.
They form a group, the hyperoctahedral group of order 2^n*n! = A000165(n), isomorphic to the group of symmetries of the n dimensional cube.
Let x_1,...,x_n be a signed permutation and put x_0 = -(n+1) and x_(n+1) = (-1)^n*(n+1). Then x_0,x_1,...,x_n,x_(n+1) is a snake of type S(n) when x_0 < x_1 > x_2 < ... x_(n+1). For example, -5 4 -3 -1 -2 5 is a snake of type S(4).
Let sc be the number of sign changes through a snake sc = #{i, 0 <= i <= n, x_i*x_(i+1) < 0}. For example, the snake -5 4 -3 -1 -2 5 has sc = 3.
The polynomial P_(n+1)(t) is the generating function for the sign change statistic on snakes of type S(n): P_(n+1)(t) = sum {snakes in S(n)} t^sc.
See the example section below for the cases n=1 and n=2.
(End)
Equals A107729 when the first column is removed. - Georg Fischer, Jul 26 2023

			The polynomials P_{-1}(u) through P_6(u) with exponents in decreasing order:
      1
      u
      u^2 +    1
    2*u^3 +    2*u
    6*u^4 +    8*u^2 +    2
   24*u^5 +   40*u^3 +   16*u
  120*u^6 +  240*u^4 +  136*u^2 +  16
  720*u^7 + 1680*u^5 + 1232*u^3 + 272*u
  ...
Triangle begins:
  1
  0, 1
  1, 0, 1
  0, 2, 0, 2
  2, 0, 8, 0, 6
  0, 16, 0, 40, 0, 24
  16, 0, 136, 0, 240, 0, 120
  0, 272, 0, 1232, 0, 1680, 0, 720
  272, 0, 3968, 0, 12096, 0, 13440, 0, 5040
  0, 7936, 0, 56320, 0, 129024, 0, 120960, 0, 40320
  7936, 0, 176896, 0, 814080, 0, 1491840, 0, 1209600, 0, 362880
  0, 353792, 0, 3610112, 0, 12207360, 0, 18627840, 0, 13305600, 0, 3628800
  ...
From _Peter Bala_, Feb 07 2011: (Start)
Examples of sign change statistic sc on snakes of type S(n):
    Snakes     # sign changes sc  t^sc
  ===========  =================  ====
n=1:
  -2  1 -2 ........... 2 ........ t^2
  -2 -1 -2 ........... 0 ........ 1
                  yields P_2(t) = 1 + t^2;
n=2:
  -3  1 -2  3 ........ 3 ........ t^3
  -3  2  1  3 ........ 1 ........ t
  -3  2 -1  3 ........ 3 ........ t^3
  -3 -1 -2  3 ........ 1 ........ t
                  yields P_3(t) = 2*t + 2*t^3. (End)

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 2nd ed. 1998, p. 287.

G. C. Greubel, Rows n = 0..101 of triangle, flattened
K. Boyadzhiev, Derivative Polynomials for tanh, tan, sech and sec in Explicit Form, arXiv:0903.0117 [math.CA], 2009-2010.
M.-P. Grosset and A. P. Veselov, Bernoulli numbers and solitons, arXiv:math/0503175 [math.GM], 2005.
Gordon Haigh, A "natural" approach to Pick's theorem, Math. Gaz. 64 (1980), no. 429, 173-180.
Michael E. Hoffman, Derivative polynomials for tangent and secant, Amer. Math. Monthly, 102 (1995), 23-30.
Michael E. Hoffman, Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences, The Electronic Journal of Combinatorics, Volume 6.1 (1999): Research paper R21, 13 p.
Donald E. Knuth and Thomas J. Buckholtz, Computation of tangent, Euler and Bernoulli numbers, Math. Comp. 21 1967 663-688.
Shi-Mei Ma, Qi Fang, Toufik Mansour, and Yeong-Nan Yeh, Alternating Eulerian polynomials and left peak polynomials, arXiv:2104.09374 [math.CO], 2021.

For other versions of this triangle see A008293, A101343.
A104035 is a companion triangle.
Highest order coefficients give factorials A000142. Constant terms give tangent numbers A000182. Other coefficients: A002301.
Setting u=1 in P_n gives A000831, u=2 gives A156073, u=3 gives A156075, u=4 gives A156076, u=1/2 gives A156102.
Setting u=sqrt(2) in P_n gives A156108 and A156122; setting u=sqrt(3) gives A156103 and A000436.
Cf. A008292, A019538, A107729, A185896.

P:=proc(n) option remember;
if n=-1 then RETURN(1); elif n=0 then RETURN(u); else RETURN(expand((u^2+1)*diff(P(n-1),u))); fi;
end;
for n from -1 to 12 do t1:=series(P(n),u,20); lprint(seriestolist(t1)); od:
# Alternatively:
with(PolynomialTools): seq(print(CoefficientList(`if`(i=0,1,D@@(i-1))(tan),tan)), i=0..7); # Peter Luschny, May 19 2015

p[n_, u_] := D[Tan[x], {x, n}] /. Tan[x] -> u /. Sec[x] -> Sqrt[1 + u^2] // Expand; p[-1, u_] = 1; Flatten[ Table[ CoefficientList[ p[n, u], u], {n, -1, 9}]] (* Jean-François Alcover, Jun 28 2012 *)
T[ n_, k_] := Which[n<0, Boole[n==-1 && k==0], n==0, Boole[k==1], True, (k-1)*T[n-1, k-1] + (k+1)*T[n-1, k+1]]; (* Michael Somos, Jul 09 2024 *)

{T(n, k) = if(n<0, n==-1 && k==0, n==0, k==1, (k-1)*T(n-1, k-1) + (k+1)*T(n-1, k+1))}; /* Michael Somos, Jul 09 2024 */

If the polynomials are denoted by P_n(u), we have the recurrence P_{-1}=1, P_0 = u, P_n = (u^2+1)*dP_{n-1}/du.
G.f.: Sum_{n >= 0} P_n(u) t^n/n! = (sin t + u*cos t)/(cos t - u sin t). [Hoffman]
From Peter Bala, Feb 07 2011: (Start)
RELATION WITH BERNOULLI NUMBERS A000367 AND A002445
Put T(n,t) = P_n(i*t), where i = sqrt(-1). We have the definite integral evaluation, valid when both m and n are >=1 and m+n >= 4:
int( T(m,t)*T(n,t)/(1-t^2), t = -1..1) = (-1)^((m-n)/2)*2^(m+n-1)*Bernoulli(m+n-2).
The case m = n is equivalent to the result of [Grosset and Veselov]. The methods used there extend to the general case.
RELATION WITH OTHER ROW POLYNOMIALS
The following three identities hold for n >= 1:
P_(n+1)(t) = (1+t^2)*R(n-1,t) where R(n,t) is the n-th row polynomial of A185896.
P_(n+1)(t) = (-2*i)^n*(t-i)*R(n,-1/2+1/2*i*t), where i = sqrt(-1) and R(n,x) is an ordered Bell polynomial, that is, the n-th row polynomial of A019538.
P_(n+1)(t) = (t-i)*(t+i)^n*A(n,(t-i)/(t+i)), where {A(n,t)}n>=1 = [1,1+t,1+4*t+t^2,1+11*t+11*t^2+t^3,...] is the sequence of Eulerian polynomials - see A008292. (End)
T(n,k) = cos((n+k)*Pi/2) * Sum_{p=0..n-1} A008292(n-1,p+1) Sum_{j=0..k}(-1)^(p+j+1) * binomial(p+1,k-j) *binomial(n-p-1,j) for n>1. - Ammar Khatab, Aug 15 2024

Name clarified by Peter Luschny, May 25 2015

A176327 Numerators of the rational sequence with e.g.f. (x/2)*(1+exp(-x))/(1-exp(-x)).

Original entry on oeis.org

1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 5, 0, -691, 0, 7, 0, -3617, 0, 43867, 0, -174611, 0, 854513, 0, -236364091, 0, 8553103, 0, -23749461029, 0, 8615841276005, 0, -7709321041217, 0, 2577687858367, 0, -26315271553053477373, 0, 2929993913841559, 0, -261082718496449122051

Offset: 0

Paul Curtz, Apr 15 2010

sign

Numerator of the Bernoulli number B_n, except B(1)=0.
A027641 is the main entry for this sequence, which is only a minor variation. - N. J. A. Sloane, Nov 29 2010.
This could formally be defined by building the arithmetic mean of the numerators in A164555(n) and A027641(n).

Antti Karttunen, Table of n, a(n) for n = 0..200

Cf. A176289 (denominators), A027642, A141056, A164020, A165823

seq(numer((bernoulli(i,0)+bernoulli(i,1))/2),i=0..40); # Peter Luschny, Jun 17 2012

terms = 41; egf = (x/2)*((1 + Exp[-x])/(1 - Exp[-x])) + O[x]^(terms+1);
CoefficientList[egf, x]*Range[0, terms-1]! // Numerator (* Jean-François Alcover, Jun 13 2017 *)

apply(numerator, Vec(serlaplace((x/2)*(1+exp(-x))/(1-exp(-x))))) \\ Charles R Greathouse IV, Sep 26 2017

a(2n+1) = 0. a(2n ) = A000367(n).

a(n) = A164555(n) = A027641(n) if n <>1.

New name from Peter Luschny, Jun 18 2012

A120082 Numerators of expansion for Debye function for n=1: D(1,x).

Original entry on oeis.org

1, -1, 1, 0, -1, 0, 1, 0, -1, 0, 1, 0, -691, 0, 1, 0, -3617, 0, 43867, 0, -174611, 0, 77683, 0, -236364091, 0, 657931, 0, -3392780147, 0, 1723168255201, 0, -7709321041217, 0, 151628697551, 0, -26315271553053477373, 0, 154210205991661, 0, -261082718496449122051

Offset: 0

Wolfdieter Lang, Jul 20 2006

Denominators are found under A120083.
D(1,x) = (1/x)*integral_{t=0..x} t/(exp(t)-1) dt (note the factor x on the r.h.s. of  the Abramowitz-Stegun link). This is the e.g.f. for {Bernoulli(n)/(n+1)}A027641(n)/A227540(n).%20Thanks%20to%20_Peter%20Luschny">{n>=0}. See A027641(n)/A227540(n). Thanks to _Peter Luschny for asking me to revisit this sequence. - Wolfdieter Lang, Jul 15 2013
Also numerators of coefficients in expansion of x/(exp(x)-1). See A227830 for denominators. - N. J. A. Sloane, Aug 01 2013

			Rationals r(n): [1, -1/4, 1/36, 0, -1/3600, 0, 1/211680, 0, -1/10886400, ...].

M. Kauers and P. Paule, The Concrete Tetrahedron, Springer 2011, p. 23.

Peter Luschny, Table of n, a(n) for n = 0..500
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, pp. 998, equ. 27.1.1 for n=1, with a factor x extracted.
Wolfdieter Lang, Rationals r(n).

Cf. A060054, A060055, A120083, A182918, A227540, A227830, A358625.

[Numerator(Bernoulli(n)/Factorial(n+1)): n in [0..50]]; // G. C. Greubel, May 01 2023

A120082 := proc(n) local b; if n = 0 then b := 1 ; elif n = 1 then b := -1/4 ; elif type(n, 'odd') then b := 0; else b := bernoulli(n)/(n+1)! ; fi; numer(b) ; end: # R. J. Mathar, Sep 03 2009
gf := (1 - x/4 + sum((bernoulli(2*k)/((2*k+1)*(2*k)!))*x^(2*k), k=0..infinity)):
a := proc(n) local ser; if n = 0 then return 1 fi; ser := series(gf, x, n+2):
numer(coeff(ser, x, n)) end: seq(a(n), n = 0..40); # Peter Luschny, Dec 02 2022

Table[Numerator[BernoulliB[n]/((n+1)!)], {n,0,50}] (* G. C. Greubel, May 01 2023 *)

def A120082(n): return numerator(bernoulli(n)/factorial(n+1))
[A120082(n) for n in range(51)] # G. C. Greubel, May 01 2023

a(n) = numerator(r(n)), with r(n) = [x^n] (1 - x/4 + Sum_{k>=0} (B(2*k)/((2*k+1)*(2*k)!))*x^(2*k)), |x| < 2*Pi. B(2*k) = A000367(k)/A002445(k) (Bernoulli numbers).
a(n) = numerator(B(n)/(n+1)!), n >= 0. See the above comment on the e.g.f. D(1,x). - Wolfdieter Lang, Jul 15 2013
Apart from the sign of a(1) this sequence differs from A358625 for the first time at n = 68. - Peter Luschny, Dec 02 2022

Edited after Andrey Zabolotskiy noticed an inconsistency by Peter Luschny, Dec 02 2022

A073277 Irregular primes with irregularity index two.

Original entry on oeis.org

157, 353, 379, 467, 547, 587, 631, 673, 691, 809, 929, 1291, 1297, 1307, 1663, 1669, 1733, 1789, 1933, 1997, 2003, 2087, 2273, 2309, 2371, 2383, 2423, 2441, 2591, 2671, 2789, 2909, 2957, 3391, 3407, 3511, 3517, 3533, 3539, 3559, 3593, 3617, 3637, 3851

Offset: 1

Robert G. Wilson v, Jul 22 2002

nonn

Subsequence of A060974.

T. D. Noe, Table of n, a(n) for n=1..10000 (from Buhler et al.)
J. Buhler, R. Crandall, R. Ernvall, T. Metsankyla and M. A. Shokrollahi, Irregular Primes and Cyclotomic Invariants to 12 Million, J. Symbolic Computation 31, 2001, 89-96.
Bernoulli numbers, irregularity index of primes

Cf. A000928, A091887, A000367, A060974, A060975 and A073276.

Do[p = Prime[n]; k = 1; c = 0; While[ 2*k < p - 3, If[ Mod[ Numerator[ BernoulliB[2*k]], p] == 0, c++ ]; k++ ]; If[ c == 2, Print[p]], {n, 3, 550} ]

A060975 Irregular primes with irregularity index three.

Original entry on oeis.org

491, 617, 647, 1151, 1217, 1811, 1847, 2939, 3833, 4003, 4657, 4951, 6763, 7687, 8831, 9011, 10463, 10589, 12073, 13217, 14533, 14737, 14957, 15287, 15787, 15823, 16007, 17681, 17863, 18713, 18869, 20533, 20939, 24019, 24659, 25153, 26561

Offset: 1

Robert G. Wilson v, Jul 22 2002

nonn

Amiram Eldar, Table of n, a(n) for n = 1..10000 (calculated by Hart et al., terms 1..9824 from T. D. Noe, calculated by Buhler et al.)
J. Buhler, R. Crandall, R. Ernvall, T. Metsankyla and M. A. Shokrollahi, Irregular Primes and Cyclotomic Invariants to 12 Million, J. Symbolic Computation 31, 2001, 89-96.
Bernoulli numbers, irregularity index of primes
William Hart, David Harvey and Wilson Ong, Irregular primes to two billion, Mathematics of Computation, Vol. 86, No. 308 (2017), pp. 3031-3049; also available at arXiv:1605.02398 [math.NT], 2016.
David Harvey, Irregular primes to two billion (includes a list of all primes less than 2^31).

Cf. A000928, A000367, A060974, A060975, A073276 and A073277.

Do[p = Prime[n]; k = 1; c = 0; While[ 2*k < p - 3, If[ Mod[ Numerator[ BernoulliB[2*k]], p] == 0, c++ ]; k++ ]; If[ c == 3, Print[p]], {n, 3, 1000} ]
Do[p = Prime@n; k = 1; c = 0; While[ 2*k < p - 3, If[ Mod[ Numerator[ BernoulliB[2*k]], p] == 0, c++ ]; k++ ]; If[ c == 3, Print@p], {n, 3, 13887} ]

Extended by Robert G. Wilson v, Sep 20 2006

A090495 Numbers k such that numerator(Bernoulli(2k)/(2k)) is different from numerator(Bernoulli(2k)/(2k(2k-1))).

Original entry on oeis.org

574, 1185, 1240, 1269, 1376, 1906, 1910, 2572, 2689, 2980, 3238, 3384, 3801, 3904, 4121, 4570, 4691, 4789, 5236, 5862, 5902, 6227, 6332, 6402, 6438, 6568, 7234, 7900, 8113, 8434, 8543, 8557, 8566, 9232, 9611, 9670, 9824, 9891, 9898, 10564, 10587, 10754, 11230, 11247, 11535, 11691, 11896, 12562, 12965, 13019, 13228, 13246, 13355, 13484, 13894, 14560, 14714, 14957, 15176, 15226, 15346, 15892, 16558, 16668, 16944, 17035, 17224, 17387, 17890, 18379, 18406, 18534, 18556, 18761, 19222, 19598, 19888, 20090

Offset: 1

N. J. A. Sloane, Feb 03 2004

Michael Somos (Feb 01 2004) discovered the remarkable fact that A001067 is different from A046968, even though they agree for the first 573 terms.
Numbers n such that A001067 is different from A046968, or alternatively, those n such that gcd(A001067(n),2n-1) is > 1.
If gcd(A000367(n), A000367(n+2)) <>1 then n = A090495(n) - (3*A090496(n) + 1)/2. - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 08 2004
So far, all terms correspond to irregular primes. Notice that these numbers are generated by n=((2k+1)p+1)/2 where p is an irregular prime and k is some integer = 1,2,... . In the Excel spreadsheet provided at the link, you will notice that much larger firstborn irregular primes p tend to produce smaller values of k. E.g., p = 691, 683, 653, k = 5, 15, 23. So by some guessing we could test a given large irregular prime for the first few values of k. I found ip's 257, 293, 311 this way, but not the index. Also the spreadsheet shows the corresponding irregular primes where the Bacher forecast fails for firstborn irregular prime. - Cino Hilliard, Feb 15 2004

Robert G. Wilson v, Table of n, a(n) for n = 1..200
Cino Hilliard, Bernoulli ratios [posted on Yahoo group B2LCC, Feb 04 2004]
Eric Weisstein's World of Mathematics, Stirling's Series

Cf. A090496, A001067, A046968, A092291. A274297.

a := n->numer(bernoulli(2*n)/(2*n)): b := n->numer(bernoulli(2*n)/(2*n*(2*n-1))): for n from 1 to 2000 do if a(n)<>b(n) then print(n,a(n)/b(n)); fi; od:

a[n_] := Numerator[BernoulliB[2n]/(2n)] (* A001067 *); b[n_] := Numerator[BernoulliB[2n]/(2n(2n-1))] (* A046968 *); For[n=1, n <= 580, n++, If[ a[n] != b[n], Print[n, " ", a[n]/b[n]] ] ]
k = 1; lst = {}; While[k < 38001, b = BernoulliB[2 k]; If [Numerator[b/(2 k)] != Numerator[b/(2 k (2 k - 1))], AppendTo[lst, k]; Print[{k}]]; k++ ]; lst (* Robert G. Wilson v, Aug 19 2010 *)

bern2(c,m1,m2) = { for(n=m1,m2, n2=n+n; a = numerator(bernfrac(n2)/(n2)); \ A001067 b = numerator(a/(n2-1)); if(a <> b,print("A("c") = "n","a/b);c++) ) } \\ Cino Hilliard

a(1)-a(7) from Michael Somos and W. Edwin Clark, Feb 03 2004
a(8)-a(9) from Robert G. Wilson v, Feb 03 2004
a(10)-a(12) from Eric W. Weisstein, Feb 03 2004
a(13)-a(39) from Cino Hilliard, Feb 03 2004
a(40) from Eric W. Weisstein, Feb 04 2004
Many further terms from Cino Hilliard, Feb 15 2004

cp's OEIS Frontend

A051716 Numerators of Bernoulli twin numbers C(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A006954 Denominators of Bernoulli numbers B_0, B_1, B_2, B_4, B_6, ...

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A051715 Denominators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)(a(n,k)-a(n,k+1)), n >= 0, k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A006863 Denominator of B_{2n}/(-4n), where B_m are the Bernoulli numbers.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A155100 Triangle read by rows: coefficients in polynomials P_n(u) arising from the expansion of D^(n-1) (tan x) in increasing powers of tan x for n>=1 and 1 for n=0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A176327 Numerators of the rational sequence with e.g.f. (x/2)*(1+exp(-x))/(1-exp(-x)).

Views

Author

Keywords

Comments

Links

A090495 Numbers k such that numerator(Bernoulli(2k)/(2k)) is different from numerator(Bernoulli(2k)/(2k(2k-1))).