87963

Appears in sequences

• a(n) is the smallest positive integer that cannot be obtained by using the number 2 at most n times and the operators +, -, *, /.at n=22A071997
• Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 9).at n=40A212368
• Main diagonal of Unlucky array: a(n) = A255543(n,n).at n=47A255549