83099

Appears in sequences

• Number of n-node trees of height at most 5.at n=16A001385
• a(n) = A027082(n, 2n-10).at n=10A027097
• Number of partitions of n such that the number of parts having multiplicity 1 is a part or the number of distinct parts is a part.at n=46A241446
• Positions of records in A329656.at n=18A329657
• Start with a(0) = a(1) = 1. If a(n) = n is the rightmost term defined so far, let a(m) = m := n + a(n-1). If the terms between a(n) and a(m) are undefined, let a(n+1) = a(n) + a(m) and if m > n+1, a(m-1) = a(n+1) + a(m).at n=36A333375
• Numbers k such that abs(A328258(k)) = abs(A328258(k+1)).at n=41A348586