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.

Showing 1-1 of 1 results.

A268431 Number of North-East paths from (0,0) to (n,n) that have odd number of times bounce off y = x to the right.

Original entry on oeis.org

1, 4, 17, 68, 270, 1064, 4181, 16404, 64322, 252184, 988890, 3879016, 15222236, 59764048, 234755661, 922591156, 3627586618, 14270426936, 56164324206, 221147123768, 871147242116, 3433076812336, 13534723031298, 53380361293960, 210606884630932
Offset: 2

Views

Author

Ran Pan, Feb 04 2016

Keywords

Comments

This sequence is related to paired pattern P_2 in Section 3.2 in Pan and Remmel's link.

Crossrefs

Formula

a(n) = binomial(2*n,n) - A268430(n).
G.f.: (2*x^2)/(1 + f(x) - 2*x*(2 + f(x) + 2*f(x)*x)), where f(x) = sqrt(1 - 4*x).
Showing 1-1 of 1 results.