A286516 a(n) = b(2*n-1)/b(2*n) where b(n) = A195441(n-1) = denominator(Bernoulli_{n}(x) - Bernoulli_{n}).

1, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 1, 13, 7, 15, 2, 17, 3, 19, 5, 7, 11, 23, 1, 5, 13, 3, 7, 29, 5, 31, 2, 11, 17, 7, 1, 37, 19, 13, 5, 41, 21, 43, 11, 3, 23, 47, 1, 7, 5, 17, 13, 53, 3, 11, 7, 19, 29, 59, 1, 61, 31, 7, 2, 65, 11, 67, 17, 23, 5, 71, 1, 73, 37

Offset: 1

Author

Bernd C. Kellner and Jonathan Sondow, May 12 2017

Keywords

• nonn

Comments

a(n) is an integer for all n, a(n) is odd if n is not a power of 2, a(2^k)=2 for all k>=1, a(n)=1 infinitely often, and a(n)=p infinitely often for every prime p. See Cor. 2 and Cor. 3 in "The denominators of power sums of arithmetic progressions". See also "Power-sum denominators".

Links

• G. C. Greubel, Table of n, a(n) for n = 1..1000
• Bernd C. Kellner, On a product of certain primes, J. Number Theory, 179 (2017), 126-141; arXiv:1705.04303 [math.NT], 2017.
• Bernd C. Kellner and Jonathan Sondow, Power-Sum Denominators, Amer. Math. Monthly, 124 (2017), 695-709; arXiv:1705.03857 [math.NT], 2017.
• Bernd C. Kellner and Jonathan Sondow, The denominators of power sums of arithmetic progressions, Integers 18 (2018), #A95, 17 pp.; arXiv:1705.05331 [math.NT], 2017.

Crossrefs

Cf. A027642, A064538, A144845, A195441, A286515, A286517, A286762, A286763.

Programs

Mathematica

b[n_] := Denominator[ Together[ BernoulliB[n, x] - BernoulliB[n]]]; Table[
b[2 n - 1]/b[2 n], {n, 1, 74}]

Formula

a(n) = A195441(2*n-2) / A195441(2*n-1).