145211

Appears in sequences

• Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.at n=24A091484
• Partial sum of Catalan numbers A000108 multiplied by powers of 10.at n=4A112704