2111209

Appears in sequences

• a(n) = (F(n+1) + L(n))^2 where F(n) are the Fibonacci numbers (A000045) and L(n) are the Lucas numbers (A000032).at n=14A014717
• Squares n with digit 1 that remain positive square after omitting all 1's from n.at n=26A176899