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.

A365751 Expansion of (1/x) * Series_Reversion( x*(1+x)*(1-x)^3 ).

This page as a plain text file.
%I A365751 #24 Feb 16 2024 09:53:45
%S A365751 1,2,8,38,201,1134,6688,40734,254237,1617572,10452416,68408626,
%T A365751 452530659,3020870352,20324167488,137672551630,938154745773,
%U A365751 6426806842566,44234352581896,305743015718028,2121318029754770,14769052147618740,103148538125870880
%N A365751 Expansion of  (1/x) * Series_Reversion( x*(1+x)*(1-x)^3 ).
%H A365751 <a href="/index/Res#revert">Index entries for reversions of series</a>
%F A365751 a(n) = (1/(n+1)) * Sum_{k=0..n} (-1)^k * binomial(n+k,k) * binomial(4*n-k+2,n-k).
%F A365751 a(n) = (1/(n+1)) * Sum_{k=0..floor(n/2)} binomial(n+k,k) * binomial(3*n-2*k+1,n-2*k). - _Seiichi Manyama_, Jan 18 2024
%F A365751 a(n) = (1/(n+1)) * [x^n] 1/( (1+x) * (1-x)^3 )^(n+1). - _Seiichi Manyama_, Feb 16 2024
%o A365751 (PARI) a(n) = sum(k=0, n, (-1)^k*binomial(n+k, k)*binomial(4*n-k+2, n-k))/(n+1);
%o A365751 (SageMath)
%o A365751 def A365751(n):
%o A365751     h = binomial(4*n + 2, n) * hypergeometric([-n, n + 1], [-4 * n - 2], -1) / (n + 1)
%o A365751     return simplify(h)
%o A365751 print([A365751(n) for n in range(23)])  # _Peter Luschny_, Sep 20 2023
%Y A365751 Cf. A063020, A365752, A365753.
%Y A365751 Cf. A352373.
%K A365751 nonn
%O A365751 0,2
%A A365751 _Seiichi Manyama_, Sep 18 2023