Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jun 22 2022 02:55:33
%S 1,5,57,989,22833,658805,22810857,921455309,42540129633,2209407621605,
%T 127500056700057,8093522778736829,560471288461196433,
%U 42046635718027122005,3396986478841654717257,294048932819502579461549,27150267978072875530135233,2663529874012507049631576005
%N Row sums of triangle A285066.
%C See A285066 for details.
%F a(n) = Sum_{m=0..n} A285066(n, m), n >= 0.
%F E.g.f.: exp(x)/(2 - exp(4*x)).
%F a(n) ~ n! * 2^(2*n - 3/4) / log(2)^(n+1). - _Vaclav Kotesovec_, Apr 19 2017
%F a(n) = 1 + Sum_{k=1..n} binomial(n,k) * 4^k * a(n-k). - _Ilya Gutkovskiy_, Jun 21 2022
%Y Cf. A285066, A141413(n+2) (alternating row sums).
%K nonn,easy
%O 0,2
%A _Wolfdieter Lang_, Apr 19 2017