90162

Appears in sequences

• 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 pyramids (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis).at n=29A108445
• Limit of the coefficient of x^(2^m+n) in B(x)^(n+1)/(n+1) as m grows, where B(x) = Sum_{k>=0} x^(2^k).at n=8A144691