login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372211 a(n) = [x^n] f(x)^n, where f(x) = (1 - x^5)^5/((1 - x^2)^2 * (1 - x^3)^3). 3

%I #11 Apr 25 2024 13:43:30

%S 1,0,4,9,36,125,535,1715,7716,26739,111379,419265,1683351,6518499,

%T 26081381,102089384,408200740,1612289384,6441151477,25602561864,

%U 102352339411,408402686750,1635036583239,6541552959219,26227281703575,105151396500125,422159487904405,1695369986497917

%N a(n) = [x^n] f(x)^n, where f(x) = (1 - x^5)^5/((1 - x^2)^2 * (1 - x^3)^3).

%C Let G(x) be a formal power series with integer coefficients. The sequence defined by g(n) = [x^n] G(x)^n satisfies the Gauss congruences: g(n*p^r) == g(n*p^(r-1)) (mod p^r) for all primes p and positive integers n and r.

%C We conjecture that in this case the stronger supercongruences a(n*p^r) == a(n*p^(r-1)) (mod p^(3*r)) hold for all primes p >= 5 and positive integers n and r. Some examples are given below. Cf. A351858.

%C More generally, if r is a positive integer and s an integer then the sequence defined by u(r,s; n) = [x^(r*n)] f(x)^(s*n) may satisfy the same supercongruences for primes p >= 7.

%C Even more generally, if a, b and m are a positive integers, with m = a + b, then the sequences whose n-th term equals [x^n] (1 - x^m)^m/((1 - x^a)^a * (1 - x^b)^b) or [x^n] (1 - x^m)^m/((1 + x^a)^a * (1 + x^b)^b) may both satisfy the above supercongruences for sufficiently large primes p depending on m.

%C The sequence of central binomial coefficients A000984 corresponds to the case m = 2 and a = b = 1.

%D R. P. Stanley, Enumerative Combinatorics Volume 2, Cambridge Univ. Press, 1999, Theorem 6.33, p. 197.

%F The o.g.f. A(x) = 1 + 4*x^2 + 9*x^3 + 36*x^4 + ... is the diagonal of the bivariate rational function 1/(1 - t*f(x)) and hence is an algebraic function over the field of rational functions Q(x) by Stanley, Theorem 6.33, p. 197.

%e Supercongruences:

%e a(11) = 419265 = (3^2)*5*7*11^3 == 0 (mod 11^3).

%e a(23) = 6541552959219 = (3^2)*(23^3)*59738573 == 0 (mod 23^3).

%e a(2*7) - a(2) = 26081381 - 4 = (7^3)*76039 == 0 (mod 7^3).

%p f(x) := (1 - x^5)^5/((1 - x^2)^2*(1 - x^3)^3):

%p seq(coeftayl(f(x)^n, x = 0, n), n = 0..27);

%Y Cf. A000984, A351858, A372212, A372213.

%K nonn,easy

%O 0,3

%A _Peter Bala_, Apr 22 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 14:49 EDT 2024. Contains 375987 sequences. (Running on oeis4.)