120435

Appears in sequences

• a(0) = 0, a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.at n=26A117823
• a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10.at n=25A302095
• Number of multisets of exactly nine nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=11A316410
• a(n) is the number of isosceles trapezoids in a triangular grid of side length n.at n=27A389363