A158381 -id:A158381 - cp's OEIS frontend

A002559 Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3xy*z.

1, 2, 5, 13, 29, 34, 89, 169, 194, 233, 433, 610, 985, 1325, 1597, 2897, 4181, 5741, 6466, 7561, 9077, 10946, 14701, 28657, 33461, 37666, 43261, 51641, 62210, 75025, 96557, 135137, 195025, 196418, 294685, 426389, 499393, 514229, 646018, 925765, 1136689, 1278818

Offset: 1

N. J. A. Sloane and J. H. Conway

A004280 gives indices of Fibonacci numbers (A000045) which are also Markoff (or Markov) numbers.
As mentioned by Conway and Guy, all odd-indexed Pell numbers (A001653) also appear in this sequence. The positions of the Fibonacci and Pell numbers in this sequence are given in A158381 and A158384, respectively. - T. D. Noe, Mar 19 2009
Assuming that each solution (x,y,z) is ordered x <= y <= z, the open problem is to prove that each z value occurs only once. There are no counterexamples in the first 1046858 terms, which have z values < Fibonacci(5001) = 6.2763...*10^1044. - T. D. Noe, Mar 19 2009
Zagier shows that there are C log^2 (3x) + O(log x (log log x)^2) Markoff numbers below x, for C = 0.180717.... - Charles R Greathouse IV, Mar 14 2010 [but see Thompson, below]
The odd numbers in this sequence are of the form 4k+1. - Paul Muljadi, Jan 31 2011
All prime divisors of Markov numbers (with exception 2) are of the form 4k+1. - Artur Jasinski, Nov 20 2011
Kaneko extends a parameterization of Markoff numbers, citing Frobenius, and relates it to a conjectured behavior of the elliptic modular j-function at real quadratic numbers. - Jonathan Vos Post, May 06 2012
Riedel (2012) claims a proof of the unicity conjecture: "it will be shown that the largest member of [a Markoff] triple determines the other two uniquely." - Jonathan Sondow, Aug 21 2012
There are 93 terms with each term <= 2*10^9 in the sequence. The number of distinct prime divisors of any of the first 93 terms is less than 6. The second, third, 4th, 5th, 6th, 10th, 11th, 15th, 16th, 18th, 20th, 24th, 25th, 27th, 30th, 36th, 38th, 45th, 48th, 49th, 69th, 79th, 81st, 86th, 91st terms are primes. - Shanzhen Gao, Sep 18 2013
Bourgain, Gamburd, and Sarnak have announced a proof that almost all Markoff numbers are composite--see A256395. Equivalently, the prime Markoff numbers A178444 have density zero among all Markoff numbers. (It is conjectured that infinitely many Markoff numbers are prime.) - Jonathan Sondow, Apr 30 2015
According to Sarnak on Apr 30 2015, all claims to have proved the unicity conjecture have turned out to be false. - Jonathan Sondow, May 01 2015
The numeric value of C = lim (number of Markoff numbers < x) / log^2(3x) given in Zagier's paper and quoted above suffers from an accidentally omitted digit and rounding errors. The correct value is C = 0.180717104711806... (see A261613 for more digits). - Christopher E. Thompson, Aug 22 2015
Named after the Russian mathematician Andrey Andreyevich Markov (1856-1922). - Amiram Eldar, Jun 10 2021

Martin Aigner, Markov's theorem and 100 years of the uniqueness conjecture. A mathematical journey from irrational numbers to perfect matchings. Springer, 2013. x+257 pp. ISBN: 978-3-319-00887-5; 978-3-319-00888-2 MR3098784
John H. Conway and Richard K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 187.
Jean-Marie De Koninck, Those Fascinating Numbers, Amer. Math. Soc., 2009, page 86.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 2.31.3, p. 200.
Richard K. Guy, Unsolved Problems in Number Theory, D12.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, notes on ch. 24.6 (p. 412)
Florian Luca and A. Srinivasan, Markov equation with Fibonacci components, Fib. Q., 56 (No. 2, 2018), 126-129.
Richard A. Mollin, Advanced Number Theory with Applications, Chapman & Hall/CRC, Boca Raton, 2010, 123-125.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1000
Ryuji Abe and Benoît Rittaud, On palindromes with three or four letters associated to the Markoff spectrum, Discrete Mathematics, Vol. 340, No. 12 (2017), pp. 3032-3043.
Tom Ace, Markoff numbers.
Enrico Bombieri, Continued fractions and the Markoff tree, Expo. Math., Vol. 25, No. 3 (2007), pp. 187-213.
Jean Bourgain, Alex Gamburd, and Peter Sarnak, Markoff triples and strong approximation, Comptes Rendus Mathematique, Vol. 354, No. 2 (2016), pp. 131-135; arXiv preprint, arXiv:1505.06411 [math.NT], 2015.
Roger Descombes, Problèmes d'approximation diophantienne, L'Enseignement Math. (2), Vol. 6 (1960), pp. 18-26.
Roger Descombes, Problèmes d'approximation diophantienne, L'Enseignement Math. (2), Vol. 6 (1960), pp. 18-26. [Annotated scanned copy]
Jonathan David Evans and Ivan Smith, Markov numbers and Lagrangian cell complexes in the complex projective plane, Geometry & Topology, Vol. 22 (2018), pp. 1143-1180; arXiv preprint, arXiv:1606.08656 [math.SG], 2016-2017.
Sam Evans, Perrine Jouteur, Sophie Morier-Genoud, and Valentin Ovsienko, On q-deformed Markov numbers. Cohn matrices and perfect matchings with weighted edges, hal-05186307 (2025). See p. 2.
Georg Frobenius, Über die Markoffschen Zahlen, Sitzungsberichte der Königlichen Preußischen Akademie der Wissenschaften, Jahrgang 1913.
Carlos A. Gómez, Jhonny C. Gómez, and Florian Luca, Markov triples with k-generalized Fibonacci components, Annales Mathematicae et Informaticae, Vol. 52 (2020), pp. 107-115.
Richard K. Guy, Don't try to solve these problems, Amer. Math. Monthly, Vol. 90, No. 1 (1983), pp. 35-41.
Yasuaki Gyoda, Positive integer solutions to (x+y)^2+(y+z)^2+(z+x)^2=12xyz, arXiv:2109.09639 [math.NT], 2021.
Hayder Raheem Hashim and Szabolcs Tengely, Solutions of a generalized markoff equation in Fibonacci numbers, Mathematica Slovaca, Vol. 70, No. 5 (2020), pp. 1069-1078.
Masanobu Kaneko, Congruences of Markoff numbers via Farey parametrization, Preliminary Report, Dec 2011, AMS 1078-11-124, listed in Abstracts of Papers Presented to AMS, Vol.33, No.2, Issue 168, Spring 2012.
Sebastien Labbé, Mélodie Lapointe, and Wolfgang Steiner, A q-analog of the Markoff injectivity conjecture holds, arXiv:2212.09852 [math.CO], 2022.
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, and Laurent Vuillon, On the Markov numbers: fixed numerator, denominator, and sum conjectures, arXiv:2010.10335 [math.CO], 2020.
Mong Lung Lang and Ser Peow Tan, A simple proof of the Markoff conjecture for prime powers, Geometriae Dedicata, Vol. 129 (2007), pp. 15-22; arXiv preprint, arXiv:math/0508443 [math.NT], 2005.
Kyungyong Lee, Li Li, Michelle Rabideau, and Ralf Schiffler, On the ordering of the Markov numbers, arXiv:2010.13010 [math.NT], 2020.
James Propp, The combinatorics of Markov numbers, U. Wisconsin Combinatorics Seminar, April 4, 2005.
S. G. Rayaguru, M. K. Sahukar, and G. K. Panda, Markov equation with components of some binary recurrent sequences, Notes on Number Theory and Discrete Mathematics, Vol. 26, No. 3 (2020), pp. 149-159.
Norbert Riedel, On the Markoff Equation, arXiv:1208.4032 [math.NT], 2012-2015.
Julieth F. Ruiz, Jose L. Herrera, and Jhon J. Bravo, Markov Triples with Generalized Pell Numbers, Mathematics 12, 108, (2024).
Anitha Srinivasan, Markoff numbers and ambiguous classes, Journal de théorie des nombres de Bordeaux, 21 no. 3 (2009), pp. 757-770.
Anitha Srinivasan, The Markoff-Fibonacci Numbers, Fibonacci Quart., Vol. 58, No. 5 (2020), pp. 222-228.
Michel Waldschmidt, Open Diophantine problems, arXiv:math/0312440 [math.NT], 2003-2004.
Eric Weisstein's World of Mathematics, Markov Number.
Wikipedia, Markov number.
Don Zagier, On the number of Markoff numbers below a given bound, Mathematics of Computation, Vol. 39, No. 160 (1982), pp. 709-723.
Ying Zhang, An Elementary Proof of Markoff Conjecture for Prime Powers, arXiv:math/0606283 [math.NT], 2006-2007.
Ying Zhang, Congruence and uniqueness of certain Markov numbers, Acta Arithmetica, Vol. 128 (2007), pp. 295-301.

Cf. A178444, A256395, A000045, A001653, A004280, A158381, A158384.

m = {1}; Do[x = m[[i]]; y = m[[j]]; a = (3*x*y + Sqrt[ -4*x^2 - 4*y^2 + 9*x^2*y^2])/2; b = (3*x*y + Sqrt[ -4*x^2 - 4*y^2 + 9*x^2*y^2])/2; If[ IntegerQ[a], m = Union[ Join[m, {a}]]]; If[ IntegerQ[b], m = Union[ Join[m, {b}]]], {n, 8}, {i, Length[m]}, {j, i}]; Take[m, 40] (* Robert G. Wilson v, Oct 05 2005 *)
terms = 40; depth0 = 10; Clear[ft]; ft[n_] := ft[n] = Module[{f}, f[] = {1, 2, 5}; f[ud___, u(*up*)] := f[ud, u] = Module[{g = f[ud]}, {g[[1]], g[[3]], 3*g[[1]]*g[[3]] - g[[2]]}]; f[ud___, d(*down*)] := f[ud, d] = Module[{g = f[ud]}, {g[[2]], g[[3]], 3*g[[2]]*g[[3]] - g[[1]]}]; f @@@ Tuples[{u, d}, n] // Flatten // Union // PadRight[#, terms]&]; ft[n = depth0]; ft[n++]; While[ft[n] != ft[n - 1], n++]; Print["depth = n = ", n]; A002559 = ft[n] (* Jean-François Alcover, Aug 29 2017 *)
MAX=10^10;
data=NestWhile[Select[Union[Sort/@Flatten[Table[{a, b, 3a b -c}/.MapThread[Rule, {{a, b, c}, #}]&/@Map[RotateLeft[ii, #]&, Range[3]], {ii, #}], 1]], Max[#]Xianwen Wang, Aug 22 2021 *)

markov = set[tuple[int, int, int]]
def MarkovNumbers(len: int = 50, MAX: int = 10**10) -> list[int]:
    cur: markov = {(1, 1, 1), (1, 1, 2), }
    def step(triples: markov) -> markov:
        ret: markov = set()
        for (a, b, c) in triples:
            for x, y, z in [(a, b, c), (b, c, a), (c, a, b)]:
                t = (x, y, 3 * x * y - z)
                if max(t) < MAX: ret.add(t)
        return ret
    while True:
        new = step(cur)
        if new == cur: break
        cur = new
    return sorted({n for triple in cur for n in triple})[:len]
print(MarkovNumbers(len=42))  # Peter Luschny, Aug 10 2025

Name clarified by Wolfdieter Lang, Jan 22 2015

A305315 a(n) = sqrt(5b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6n+1), n >= 0.

Original entry on oeis.org

1, 29, 521, 9349, 167761, 3010349, 54018521, 969323029, 17393796001, 312119004989, 5600748293801, 100501350283429, 1803423556807921, 32361122672259149, 580696784543856761, 10420180999117162549, 186982561199565069121, 3355265920593054081629, 60207804009475408400201, 1080385206249964297121989

Offset: 0

Wolfdieter Lang, Jul 10 2018

This sequence gives all solutions of one of two classes of positive proper solutions a(n) = a1(n) of the Pell equation a(n)^2 - 5*b(n) = -4 with b(n) = b1(n) = Fibonacci(6*n+1) = A134493(n). These solutions are obtained from the fundamental positive solution [1, 1] (to be read as a column vector) by application of positive powers of the automorphic matrix A = matrix([9, 20], [4, 9]) with determinant +1.
The other class of positive proper solutions is obtained similarly from the fundamental solution [11,5] and is given by [a5(n), b5(n)], with a5(n) = A305316(n) and b5(n) = A134497(n) = F(6*n+5), with the Fibonacci numbers F = A000045.
The remaining positive solutions are improper and are obtained by application of the same matrix A on the fundamental improper solution [4, 2]. They are given by [a3(n), b3(n)], with a3(n) = 4*A049629(n) and b3(n) = A134495(n) = 2*A007805(n).
Via the Cayley-Hamilton theorem the powers of the automorphic matrix A are: A^n = matrix([S(n) - 9*S(n-1), 20*S(n-1)], [4*S(n-1), S(n) - 9*S(n-1)]) with the Chebyshev polynomials S(n-1) = S(n-1, x=18) = A049660(n), n >= 0.
This shows that ordered Markoff (Markov) triples [1, y, m], with 1 <= y <= m, have for m  from the union of sets {m1(k)}{k>=0} U {m5(k)}{k>=0) U {m3(k)}_{k>=0)}, with mj(k) = F(6*k+j), for j = 1, 5, and 3, the unique solutions yj(k) = (3*F(6*k+j) - aj(k))/2  < mj(k), namely y1(k) = F(6*k-1) = A134497(k-1) with F(-1) = 1,  y5(k) = F(6*k+3) = A134495(k) and y3(k) = F(6*k+1) = A134493. The solutions with the + sign are excluded because they are > mj(k). This trisection of the odd-indexed Fibonacci numbers as m numbers shows again the well known fact that each of them appears as largest member in a Markoff triple if the smallest member is x = 1. The positions of the odd-indexed Fibonacci numbers in the Markoff sequence A002559 are given in A158381. The conjecture in this case is that the odd-indexed Fibonacci numbers appear as largest numbers only in the ordered Markov triples with x = 1. See, e.g., the Aigner reference for the general Frobenius-Markoff conjecture.
Also Lucas numbers that are congruent to 1 mod 4. - Fred Patrick Doty, Aug 03 2020

			The solutions of the first class of positive proper solutions [a1(n), b1(n)] of the Pell equation  a^2 - 5*b^2 = -4  begin: [1, 1], [29, 13], [521, 233], [9349, 4181], [167761, 75025], [3010349, 1346269], [54018521, 24157817], ...
The solutions of the second class of positive proper solutions [a5(n), b5(n)] begin: [11, 5], [199, 89], [3571, 1597], [64079, 28657], [1149851, 514229], [20633239, 9227465], [370248451, 165580141], ...
The solutions of the class of improper positive solutions [a3(n), b3(n)] begin: [4, 2], [76, 34], [1364, 610], [24476, 10946], [439204, 196418], [7881196, 3524578], [141422324, 63245986], ...

Aigner, Martin. Markov's theorem and 100 years of the uniqueness conjecture. A mathematical journey from irrational numbers to perfect matchings. Springer, 2013.

Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (18,-1).

Cf. A000045, A002559, A007805, A049629, A049660, A134493, A134495, A134497, A158381, A305316.

Select[LinearRecurrence[{1, 1}, {1, 3}, 115], Mod[#, 4] == 1 &] (* Fred Patrick Doty, Aug 03 2020 *)

my(x='x+O('x^20)); Vec((1+11*x)/(1-18*x+x^2)) \\ Altug Alkan, Jul 11 2018

a(n) = sqrt(5*(F(6*n+1))^2 - 4), with F(6*n+1) = A134493(n), n >= 0.
a(n) = S(n, 18) + 11*S(n-1, 18), n >= 0, with the Chebyshev polynomials S(n, 18) = A049660(n+1) and S(-1, 18) = 0.
a(n) = 18*a(n-1) - a(n-2), n >= 1, with a(0)=1 and a(-1) = -11.
G.f.: (1 + 11*x)/(1 - 18*x + x^2).
a(n) = 2*sinh((6*n + 1)*arccsch(2)). - Peter Luschny, May 25 2022

cp's OEIS Frontend

A002559 Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3xy*z.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A158384 Positions of Pell numbers in the sequence of Markoff numbers (A002559).

Views

Author

Keywords

Comments

Crossrefs

A305315 a(n) = sqrt(5b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6n+1), n >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

cp's OEIS Frontend

A002559 Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A158384 Positions of Pell numbers in the sequence of Markoff numbers (A002559).

Views

Author

Keywords

Comments

Crossrefs

A305315 a(n) = sqrt(5*b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6*n+1), n >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A002559 Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3xy*z.

A305315 a(n) = sqrt(5b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6n+1), n >= 0.