104289

Appears in sequences

• a(n) is the smallest positive integer that cannot be obtained using at most n-1 of the integers {1, 2, ..., n} using each number at most once and the operators +, -, *, /.at n=9A071985
• Binomial transform of [1, 4, 10, 20, 0, 0, 0, ...].at n=32A143131
• Multiples of 3 in A247665 in order of appearance.at n=22A248381
• Number of length 5+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=7A249711