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.

A377219 Expansion of the o.g.f. A(x) defined by [x^n] A(x)^(120*n) = (5*n)!/n!^5 for n >= 0.

Original entry on oeis.org

1, 1, 353, 318986, 408941594, 633438203535, 1105336091531052, 2093867978990821853, 4212168629863126220194, 8871676970891643267231886, 19375253437183554713216237582, 43574669954100844749472466829032, 100404408695672206422230611142618195, 236114213302057579962294974098604849352, 564982003808755415617353442524468859709030
Offset: 0

Views

Author

Peter Bala, Oct 20 2024

Keywords

Comments

Compare with A000984(n) = [x^n] (1 + x)^(2*n) = (2*n)!/n!^2.
The central binomial coefficients A000984(n) satisfy the supercongruences u(n*p^k) == u(n*p^(k-1)) (mod p^(3*k)) for all primes p >= 5 and positive integers n and k.
More generally, for positive integers r and s, the sequence {u(r,s; n) : n >= 0} defined by u(r,s; n) = [x^(s*n)] (1 + x)^(r*n) = binomial(r*n, s*n) satisfies the same supercongruences (Meštrović, Section 6, equation 39).
Conjecture: for positive integers r and s, the sequence {v(r,s; n) : n >= 0} defined by v(r,s; n) = [x^(s*n)] A(x)^(r*n) also satisfies the same supercongruences.

Crossrefs

Programs

  • Maple
    Order := 25:
    E(x) := exp(add((5*n)!/n!^5 * x^n/n, n = 1..25)):
    solve(series(x*E(x),x) = y, x):
    convert(%, polynom):
    g := taylor(y/%, y = 0, 25):
    seq(coeftayl(g^(1/120), y = 0,  n), n = 0..20);

Formula

O.g.f.: A(x) = ( x/(x * series_reversion(E(x)))^(1/120), where E(x) = exp(Sum_{n >= 1} (5*n)!/n!^5 *x^n/n) is the o.g.f. of A333043.