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 A262441 #23 Sep 08 2022 08:46:14 %S A262441 1,2,5,16,58,226,924,3910,16979,75232,338776,1545886,7132580,33219086, %T A262441 155963851,737383488,3507680650,16776206680,80622416976,389123999656, %U A262441 1885405316596,9167409871040,44717351734160,218762640192838,1073082055680180 %N A262441 a(n) = Sum_{k=0..n+1}(binomial(n-1,k)/(k+1)*binomial(n+k+1,n-k)). %H A262441 Seiichi Manyama, <a href="/A262441/b262441.txt">Table of n, a(n) for n = 0..1000</a> %F A262441 G.f.: 1/x-1/A(x), where A(x) is g.f. of A109081. %F A262441 Recurrence: 2*(n+1)*(2*n - 1)*(19*n - 30)*a(n) = 20*(19*n^3 - 49*n^2 + 34*n - 6)*a(n-1) + 2*(n-2)*(38*n^2 - 79*n + 15)*a(n-2) + 3*(n-3)*(n-2)*(19*n - 11)*a(n-3). - _Vaclav Kotesovec_, Sep 23 2015 %F A262441 a(n) = (n + 1)*hypergeom([1 - n, -n, n + 2], [3/2, 2], 1/4). - _Peter Luschny_, Mar 07 2022 %t A262441 Join[{1}, Table[Sum[ Binomial[n-1, k] / (k+1) Binomial[ n+k+1, n-k], {k, 0, n+1}], {n, 25}]] (* _Vincenzo Librandi_, Sep 23 2015 *) %o A262441 (Maxima) %o A262441 a(n):=sum(binomial(n,k)*binomial(n+k-2,n-k-1),k,0,n-1)/n; %o A262441 A(x):=sum(a(n)*x^n,n,1,30); %o A262441 taylor((1/x-1/A(x)),x,0,10); %o A262441 (Magma) [&+[Binomial(n-1, k)/(k+1)*Binomial(n+k+1, n-k): k in [0..n]]: n in [0..25]]; // _Vincenzo Librandi_, Sep 23 2015 %o A262441 (PARI) a(n)=sum(k=0,n+1,(binomial(n-1,k)/(k+1)*binomial(n+k+1,n-k))) \\ _Anders Hellström_, Sep 23 2015 %Y A262441 Cf. A109081, A161798. %K A262441 nonn %O A262441 0,2 %A A262441 _Vladimir Kruchinin_, Sep 23 2015