46162

Appears in sequences

• For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of x.at n=6A059494
• a(1)=a(2)=1; a(n)=reverse(reverse(a(n-1))+reverse(a(n-2))) for n > 2.at n=24A072210
• Numbers k such that 3^k + k^2 is prime.at n=8A075898
• A109912(n+1)/A109912(n).at n=11A109913
• a(n) = Sum_{1 <= x_1 <= x_2 <= x_3 <= x_4 <= n} gcd(x_1, x_2, x_3 , x_4, n).at n=29A343518