# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a365609
Showing 1-1 of 1

%I A365609 #25 Sep 17 2023 10:11:10
%S A365609 1,0,1,1,4,9,27,78,231,715,2193,6954,21999,70840,228896,746650,
%T A365609 2447757,8072208,26745627,89002364,297344960,996865397,3352918429,
%U A365609 11310307593,38256171642,129718262583,440855654827,1501451066767,5123671576890,17516503865294
%N A365609 G.f. satisfies A(x) = 1 + x^2*A(x)^4*(1 + x*A(x)).
%F A365609 a(n) = Sum_{k=0..floor(n/2)} binomial(k,n-2*k) * binomial(n+2*k+1,k) / (n+2*k+1).
%o A365609 (PARI) a(n) = sum(k=0, n\2, binomial(k, n-2*k)*binomial(n+2*k+1, k)/(n+2*k+1));
%Y A365609 Cf. A001005, A025250, A055113, A217358.
%Y A365609 Cf. A365690.
%K A365609 nonn
%O A365609 0,5
%A A365609 _Seiichi Manyama_, Sep 17 2023

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE