156766

Appears in sequences

• Number of Motzkin paths of length n with no level steps at height 1.at n=16A217312
• a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists.at n=34A381183