The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A352655 a(n) = (1/2)*(A005258(n) + A005258(n-1)). 9

%I #22 Oct 13 2022 12:53:12

%S 2,11,83,699,6252,58106,554633,5399099,53356322,533627511,5388927513,

%T 54859837434,562267554552,5796123147756,60047675871333,

%U 624801952898619,6526036790730942,68395815476047901,718992874207884953,7578808590187108199

%N a(n) = (1/2)*(A005258(n) + A005258(n-1)).

%C The Apéry numbers A005258 satisfy the supercongruences A005258(p) == 3 (mod p^3) and A005258(p-1) == 1 (mod p^3) for primes p >= 5. It easily follows that a(p) == 2 (mod p^3) for primes p >= 3. We conjecture that the stronger supercongruences a(p) == 2 (mod p^5) hold for primes p >= 5. See A212334 for the corresponding conjecture for the Apéry numbers A005259.

%C Conjecture: for r >= 2, and all primes p >= 5, a(p^r) == a(p^(r-1)) ( mod p^(3*r+3) ). - _Peter Bala_, Oct 13 2022

%F a(n) = (1/2)*Sum_{k = 0..n} (2*n^2 - k*n + k^2)/(n*(n + k)) * binomial(n,k)^2 * binomial(n + k,k).

%F a(n) = (1/2)*Sum_{k = 0..n-1} (4*n + k)*(n - k)/(n*(n + k)) * binomial(n,k)^2* binomial(n + k,k) for n >= 1.

%F a(n) = (1/2)*(A108628(n-1) + 3*A208675(n)) for n >= 1.

%F a(n) = (1/2)*(2*A103882(n) - A352654(n)).

%F a(n) ~ 5^(3/4)*(13 + 5*sqrt(5))/(20*sqrt(22 + 10*sqrt(5))*Pi*n) * ((11 + 5*sqrt(5))/2)^n.

%F (11*n^2 - 31*n + 22)*n^2*a(n) = (121*n^4 - 462*n^3 + 607*n^2 - 322*n + 64)*a(n-1) + (11*n^2 - 9*n + 2)*(n - 2)^2*a(n-2) with a(1) = 2 and a(2) = 11.

%F The g.f. A(x) = 2*x + 11*x^2 + 83*x^3 + ... satisfies the differential equation

%F (x^5 + 13*x^4 + 22*x^3 + 9*x^2 - x)*A''(x) + (x^4 + 4*x^3 + 26*x^2 + 22*x - 1)*A'(x) + (2*x^2 - 16*x + 4)*A(x) + x^2 - 8*x + 2 = 0, with A(0) = 2 and A'(0) = 11.

%e Examples of superconguences:

%e a(5) - 2 = 6252 - 2 = 2*(5^5) == 0 (mod 5^5).

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

%e a(11) - 2 = 5388927513 - 2 = (11^5)*33461 == 0 (mod 11^5).

%p seq((1/2)*add((2*n^2 - k*n + k^2)/(n*(n + k)) * binomial(n, k)^2 * binomial(n + k, k), k = 0..n), n = 1..20);

%o (PARI) f(n) = sum(k=0, n, binomial(n, k)^2 * binomial(n+k, k)); \\ A005258

%o a(n) = (f(n) + f(n-1))/2; \\ _Michel Marcus_, Apr 20 2022

%Y Cf. A005258, A103882, A108628, A208675, A212334, A352654.

%K nonn,easy

%O 1,1

%A _Peter Bala_, Apr 17 2022

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 May 20 17:58 EDT 2024. Contains 372720 sequences. (Running on oeis4.)