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 #7 Apr 18 2023 09:48:42
%S 1,31,2529,284191,37071329,5268723231,791682591201,123697944483359,
%T 19894672175770081,3271817054307112479,547678880100062177761,
%U 93006445178165754746399,15983911852747899752786401
%N Row sums of unsigned N(5) staircase array A062986.
%F a(n) = N(5; n, -1) with polynomials N(5; n, x) defined in A062986.
%F a(n) = Sum(((-1)^(n-j))*2^(4*j+1)*A002294(j), j=1..n)+(-1)^n, with A002294(j) = A062993(j+3, 3) = binomial(5*j, j)/(4*j+1).
%Y Cf. A002294, A062986, A062993.
%K nonn,easy
%O 0,2
%A _Wolfdieter Lang_, Jul 12 2001