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 A344396 #24 Dec 23 2024 21:50:40
%S A344396 1,5,25,133,726,4037,22737,129285,740554,4266830,24701425,143567173,
%T A344396 837212650,4896136845,28703894775,168640510725,992671051482,
%U A344396 5853000551090,34562387229046,204368928058958,1209916827501876,7170955214476509,42543879586512435,252638095187722437
%N A344396 a(n) = binomial(2*n + 1, n)*hypergeom([-(n + 1)/2, -n/2], [n + 2], 4).
%C A344396 Related to the Motzkin triangle A064189 counting certain lattice paths.
%F A344396 a(n) = Sum_{j=0..2*n+1} C(2*n + 1, j)*(C(2*n + 1 - j, j + n) - C(2*n + 1 - j, j + n + 2)).
%F A344396 a(n) = A064189(2*n+1, n).
%F A344396 a(n) = A026300(2*n+1, n+1).
%F A344396 a(n) ~ sqrt((5242 + 18674/sqrt(13))/2187) * ((70 + 26*sqrt(13))/27)^n / sqrt(Pi*n). - _Vaclav Kotesovec_, May 19 2021
%F A344396 From _Peter Bala_, Aug 03 2023: (Start)
%F A344396 P-recursive: 3*(13*n - 4)*(3*n + 2)*(3*n + 1)*(n + 1)*a(n) = 2*(2*n + 1)*(455*n^3 + 315*n^2 - 44*n - 24)*a(n-1) + 36*(13*n + 9)*(2*n + 1)*(2*n - 1)*n*a(n-2) with a(0) = 1 and a(1) = 5.
%F A344396 a(n) = (1/2)*A027908(n+1). (End)
%p A344396 alias(C=binomial):
%p A344396 a := n -> add(C(2*n + 1, j)*(C(2*n + 1 - j, j + n) - C(2*n + 1 - j, j + n + 2)), j = 0..2*n+1): seq(a(n), n=0..23);
%t A344396 a[n_] := Binomial[2 n + 1, n] Hypergeometric2F1[-(n + 1)/2, -n/2, n + 2, 4];
%t A344396 Table[a[n], {n, 0, 23}]
%Y A344396 Cf. A027908, A064189, A026300, A344394, A327871.
%K A344396 nonn
%O A344396 0,2
%A A344396 _Peter Luschny_, May 19 2021