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.

A047817 Denominators of Hurwitz numbers H_n (coefficients in expansion of Weierstrass P-function).

Original entry on oeis.org

10, 10, 130, 170, 10, 130, 290, 170, 4810, 410, 10, 2210, 530, 290, 7930, 170, 10, 351130, 10, 6970, 3770, 890, 10, 214370, 1010, 530, 524290, 557090, 10, 325130, 10, 170, 130, 1370, 290, 5969210, 1490, 10, 1081730, 6970, 10, 3770
Offset: 1

Views

Author

Keywords

Comments

Hurwitz showed (see Katz, eqn. 9) that a(n) = product of the prime p = 2 and the primes p of the form 4*k + 1 such that p - 1 divides 4*n. It follows that a(n) is a divisibility sequence, that is, if n | m then a(n) | a(m). - Peter Bala, Jan 08 2014

Examples

			Hurwitz numbers H_1, H_2, ... = 1/10, 3/10, 567/130, 43659/170, 392931/10, ...
		

References

  • F. Lemmermeyer, Reciprocity Laws, Springer-Verlag, 2000; see p. 276.

Crossrefs

For numerators see A002306.
Cf. A160014.

Programs

  • Maple
    H := proc(n) local k; option remember; if n = 1 then 1/10 else 3*add((4*k - 1)*(4*n - 4*k - 1)*binomial(4*n, 4*k)*H(k)*H(n - k), k = 1 .. n - 1)/( (2*n - 3)*(16*n^2 - 1)) fi; end;
    a := n -> denom(H(n));
    # Implementation based on Hurwitz's extension of Clausen's theorem:
    GenClausen := proc(n) local k,S; map(k->k+1, numtheory[divisors](n));
        S := select(p-> isprime(p) and p mod 4 = 1, %);
        if S <> {} then 2*mul(k,k=S) else NULL fi end:
    A047817_list := proc(n) local i; seq(GenClausen(i),i=1..4*n) end;
    A047817_list(42); # Peter Luschny, Oct 03 2011
    # Implementation based on Weierstrass's P-function:
    c := n -> (n*(4*n-2)!/(2^(4*n-2)))*coeff(series(WeierstrassP(z,4,0),z, 4*n+2),z,4*n-2); a := n -> denom(c(n)); seq(a(n), n=1..42); # Peter Luschny, Aug 18 2014
  • Mathematica
    a[1] = 1/10; a[n_] := a[n] = (3/(2*n - 3)/(16*n^2 - 1))* Sum[(4*k - 1)*(4*n - 4*k - 1)*Binomial[4*n, 4*k]*a[k]* a[n - k], {k, 1, n - 1}]; Denominator[ Table[a[n], {n, 1, 42}]] (* Jean-François Alcover, Oct 18 2011, after PARI *)
    a[ n_] := If[ n < 1, 0, Denominator[ 2^(-4 n) (4 n)! SeriesCoefficient[ 1 - x WeierstrassZeta[ x, {4, 0}], {x, 0, 4 n}]]]; (* Michael Somos, Mar 05 2015 *)
  • PARI
    do(lim)=v=vector(lim); v[1]=1/10; for(n=2,lim,v[n]=3/(2*n-3)/(16*n^2-1)*sum(k=1,n-1,(4*k-1)*(4*n-4*k-1)*binomial(4*n,4*k)*v[k]*v[n-k])) \\ Henri Cohen, Mar 18 2002

Formula

Let P be the Weierstrass P-function satisfying P'^2 = 4*P^3 - 4*P. Then P(z) = 1/z^2 + Sum_{n>=1} 2^(4n)*H_n*z^(4n-2)/(4n*(4n-2)!).
Sum_{ (r, s) != (0, 0) } 1/(r+si)^(4n) = (2w)^(4n)*H_n/(4n)! where w = 2 * Integral_{0..1} dx/(sqrt(1-x^4)).
See PARI line for recurrence.