394391

Appears in sequences

• a(n) is the number of the two-sided n-step prudent walks ending on the top side of their box, avoiding both patterns Left^k and Down^k for k>=3.at n=14A178035
• Consider any concatenation of the type n = concat(a,b). Sequence lists numbers whose reverses are the sum of the products of some of such couples a and b.at n=20A281555