2922509

Properties

Appears in sequences

• Primes of the form F(i)^2 + F(j)^2, where F() are Fibonacci numbers.at n=18A045703
• Define C(n) by the recursion C(0) = 1 + I where I^2 = -1, C(n+1) = 1/(1+C(n)); then a(n) = (-1)^n/Im(C(n)) where Im(z) is the imaginary part of the complex number z.at n=15A069921
• Non-Fibonacci Markoff numbers.at n=31A111032
• Markov numbers that are prime.at n=18A178444
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 2, a(2) = 0, a(3) = 1.at n=33A295682
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 2, a(2) = 1, a(3) = 1.at n=32A295690
• a(0) = 2, a(1) = 5, and a(n) = 7*a(n-1) - a(n-2) - 4 for n >= 2.at n=8A350922
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 5, a(3) = 7.at n=30A362388
• Markoff numbers that are powers of one odd prime or twice powers of one odd prime.at n=24A386894
• The odd Markoff numbers.at n=35A388291
• Prime numbersat n=211625