62210

Appears in sequences

• Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=28A002559
• 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=11A069921
• Number of compositions into Fibonacci numbers (1 counted as two distinct Fibonacci numbers).at n=12A080888
• Non-Fibonacci Markoff numbers.at n=16A111032
• Composite Markoff numbers.at n=13A256395
• 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=25A295682
• 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=24A295690
• Sums of positive coefficients in generalized Chebyshev polynomials of the first kind, for a family of 5 data.at n=6A301420
• Second member m_2(n) of the Markoff triple MT(n) with largest member m(n) = A002559(n), and smallest member m_1(n) = A305313(n), for n >= 1. These triples are conjectured to be unique.at n=58A305314
• a(n) = (x(n)^2 + 1)/m(n), with m(n) = A002559(n) (Markoff numbers) and x(n)= A324601(n), for n >= 3. The Markoff uniqueness conjecture is assumed to be true.at n=33A309161
• Positive integers k such that (k+1)^4 has a divisor congruent to -1 modulo k.at n=47A350916
• a(0) = 2, a(1) = 5, and a(n) = 7*a(n-1) - a(n-2) - 4 for n >= 2.at n=6A350922
• 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=22A362388
• Alternative version of the Markov tree A327345.at n=32A368546