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.
%I A357513 #13 Jun 02 2025 15:26:27
%S A357513 0,4,81,14651,956875,1335793103,697621869,3929170277787,
%T A357513 573290332967211,8235727724024089939,172296487023049395523,
%U A357513 5032311952710217004416313,114828404520381550476341513,5947240175728534283432460589661,144126887537331651710781931325261
%N A357513 a(n) = numerator of Sum_{k = 1..n} (1/k^3) * binomial(n,k)^2 * binomial(n+k,k)^2 for n >= 1 with a(0) = 0.
%C A357513 Let m be a nonnegative integer and set u(n) = the numerator of Sum_{k = 0..n} 1/k^(2*m+1) * binomial(n,k)^2 * binomial(n+k,k)^2. We conjecture that u(p-1) == 0 (mod p^4) for all primes p, with a finite number of exceptions that depend on m.
%H A357513 A. Straub, <a href="https://arxiv.org/abs/1401.0854">Multivariate Apéry numbers and supercongruences of rational functions</a>, arXiv:1401.0854 [math.NT] (2014).
%F A357513 Conjecture: a(p-1) == 0 (mod p^4) for all primes p >= 3 except p = 7 (checked up to p = 499).
%F A357513 Note: the Apery numbers A(n) = A005259(n) = Sum_{k = 0..n} binomial(n,k)^2 * binomial(n+k,k)^2 satisfy the supercongruence A(p-1) == 1 (mod p^3) for all primes p >= 5 (see, for example, Straub, Introduction).
%e A357513 a(11 - 1) = 172296487023049395523 = (11^4)*(43^2)*6163*1032705769 == 0 (mod 11^4).
%p A357513 seq(numer(add( (1/k^3) * binomial(n,k)^2 * binomial(n+k,k)^2, k = 1..n )), n = 0..20);
%o A357513 (PARI) a(n) = if (n, numerator(sum(k=1, n, binomial(n,k)^2*binomial(n+k,k)^2/k^3)), 0); \\ _Michel Marcus_, Oct 04 2022
%Y A357513 Cf. A005259, A357510, A357511, A357512.
%K A357513 nonn,easy
%O A357513 0,2
%A A357513 _Peter Bala_, Oct 02 2022