48309

Appears in sequences

• a(n) = smallest positive integer that cannot be obtained using the number n at most n times and the operations +, -, *, /, where intermediate subexpressions must be integers.at n=16A071848
• Number of n X 3 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=14A281760
• Triangle of number of 312-avoiding reduced valid hook configurations with n hooks that are on permutations with 2n + k points, for n=1 and 1<=k<=n.at n=16A338368