OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..4655
M. W. Coffey, V. de Angelis, A. Dixit, V. H. Moll, et al., The Zagier polynomials. Part II: Arithmetic properties of coefficients, arXiv:1303.6590 [math.NT], 2013.
Atul Dixit, Victor H. Moll, Christophe Vignat, The Zagier modification of Bernoulli numbers and a polynomial extension. Part I, arXiv:1209.4110v1 [math.NT], 2012.
D. Zagier, A modified Bernoulli number, Nieuw Archief voor Wiskunde, 16:63-72, 1998.
FORMULA
a(n) = denominator(sum_{r=0..n} C(n+r,2*r)*B(r)/(n+r)); B(r) the Bernoulli numbers.
a(n)=4 if n is odd. - Robert Israel, Mar 08 2018
MAPLE
f:= proc(n) if n::odd then 4 else denom(-n/4 + add(binomial(n+r, 2*r)*bernoulli(r)/(n+r), r=0..n, 2)) fi end proc:
map(f, [$1..100]); # Robert Israel, Mar 08 2018
MATHEMATICA
a[n_] := Sum[ Binomial[n + k, 2*k]*BernoulliB[k]/(n + k), {k, 0, n}] // Denominator; Table[a[n], {n, 1, 53}] (* Jean-François Alcover, Jul 26 2013 *)
PROG
(Sage)
def A216923(n):
return add(binomial(n+r, 2*r)*bernoulli(r)/(n+r) for r in (0..n)).denominator()
[A216923(n) for n in (1..53)]
(PARI) a(n) = denominator(sum(r=0, n, binomial(n+r, 2*r)*bernfrac(r)/(n+r))); \\ Michel Marcus, Aug 05 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Sep 20 2012
STATUS
approved