2086912

Appears in sequences

• 6^n mod 4^n.at n=11A138611
• a(1)=2, a(2)=3; a(n) is the smallest k > a(n-1) such that k + a(n-1) is a multiple of a(n-2).at n=40A328724
• a(n) = 2^(2*n - 1) - 2^(n - 1)*(n - 1).at n=11A376585