373230

Appears in sequences

• Consider asymmetric 1-D random walk with set of possible jumps {-1,+1,+2}. Sequence gives number of paths of length n ending at origin.at n=16A176806
• Greater of friendly pairs where both terms belong to A014574.at n=11A216058