135490

Appears in sequences

• Number of paths from (0,0) to (3n,0) that stay in the first quadrant, consist of steps u=(2,1), U=(1,2), or d=(1,-1) and do not touch the x-axis, except at the endpoints.at n=6A108424
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k returns to the x-axis.at n=21A108435
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having abscissa of first return equal to 3k.at n=27A108439
• a(n) = n*Fibonacci(n) + binomial(n, 2).at n=19A132920
• G.f. satisfies A(x) = 1 + x/A(x)*(1 + 1/A(x)).at n=7A364394
• Consecutive states of the linear congruential pseudo-random number generator (1597*s + 51749) mod 244944 when started at s=1.at n=33A385359