50062

Appears in sequences

• a(n) = A027082(n, 2n-2).at n=10A027089
• a(n) = greatest number in row n of array T given by A027082.at n=12A027102
• a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/3).at n=35A120149
• Numbers appearing in the cycles of the "Recurring Digital Invariant Variant" problem described in A151543.at n=41A151544
• Base-10 pseudo-altruistic numbers.at n=25A157714