860142

Appears in sequences

• Number of paths from (0,0) to (n,n) avoiding 3 or more consecutive east steps and 3 or more consecutive north steps.at n=15A177790
• Numbers that have decimal expansion c(1)c(2)...c(n) with distinct digits that satisfy c(1) <> 0, c(1) is the largest digit, and for each i in 1..n there is j in 0..2 such that c(i) == 3*c(i-1) + j (mod 10) (with c(0): = c(n)).at n=47A336661