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.

A246053 The denominator of h(n-k)*h(k)/h(n) where h(x) = zeta(2*x)*(4^x-2) and k = floor(n/2).

Original entry on oeis.org

2, 2, 7, 62, 381, 365, 1414477, 573370, 118518239, 5749691557, 274638832071, 768018339627, 29741482024668555, 860983513348179, 65053034220152267, 1850237821952082716222, 16555640865486520478399, 962703047799452264039, 29167285342563717499865628061
Offset: 0

Views

Author

Peter Luschny, Aug 12 2014

Keywords

Comments

There are terms that are not squarefree. For example, a(113) is divisible by 631^2 and a(114) is divisible by 103^2. Most terms appear to be divisible by numerator(bernoulli(2*n)/factorial(2*n)) but not all. The first two exceptions are a(1437) and a(23766). - Hans Havermann, Aug 16 2014

Examples

			a( 0) = 2
a( 1) = 2
a( 2) = 7
a( 3) = 2 * 31
a( 4) = 3 * 127
a( 5) = 5 * 73
a( 6) = 23 * 89 * 691
a( 7) = 2 * 5 * 7 * 8191
a( 8) = 7 * 31 * 151 * 3617
a( 9) = 43867 * 131071
a(10) = 3 * 283 * 617 * 524287
a(11) = 3 * 7 * 11 * 127 * 131 * 337 * 593
a(12) = 3 * 5 * 47 * 103 * 178481 * 2294797
a(13) = 3 * 13 * 31 * 601 * 1801 * 657931
		

Crossrefs

Cf. A242035 (numerator), A240978 (largest prime divisor), A242050, A246051, A246052.

Programs

  • Sage
    h = lambda x: zeta(2*x)*(4^x-2)
    A246053 = lambda n: Integer((h((n+1)//2)*h(n//2)/h(n)).denominator())
    [A246053(n) for n in range(19)]

Formula

a(n) = A246052(n, floor(n/2)).