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.

A079280 Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.

This page as a plain text file.
%I A079280 #11 Sep 09 2019 01:22:54
%S A079280 1,2,2,5,7,17,26,62,99,233,382,890,1486,3434,5812,13340,22819,52073,
%T A079280 89846,204002,354522,801422,1401292,3155300,5546382,12444842,21977516,
%U A079280 49155332,87167164,194392628,345994216,769547192,1374282019,3049104233
%N A079280 Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.
%C A079280 The first S step can only come after an E step.
%F A079280 G.f.: (1-x)/(2-4*x) + (1+3*x)/(2*sqrt(1-4*x^2));
%F A079280 a(2n) = (1/2)*(4^(n-1) + 3*binomial(2n-2, n-1));
%F A079280 a(2n+1) = (1/2)*(2*4^(n-1) + binomial(2n, n)).
%K A079280 nonn
%O A079280 1,2
%A A079280 _Wenjin Woan_, Feb 07 2003
%E A079280 More terms from _Max Alekseyev_, Jul 04 2009