214781

Appears in sequences

• Number of length n+4 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=22A255111
• Positive integers j of the form Sum_{i=1..k} b(i)c(i), i.e., not in A297345 such that there is only one set {c(1),...,c(k)} where the c(i) are drawn with repetition from {b(0),...,b(k)} and b(k+1) is the smallest element of A297345 that is larger than j, where b() is A297345.at n=56A300730