Matiyasevich showed that these can be defined by a Diophantine equation, leading to a proof of the insolubility of Hilbert's tenth problem.  They have
Matiyasevich showed that these can be defined by a Diophantine equation, leading to a proof of the insolubility of Hilbert's tenth problem.  They have a generating function of  "x over quantity 1 minus x minus x squared" and Euclid's algorithm for the greatest common factors has its worst run time when the entries are successive terms of these numbers, so, in that sense, the most irrational number is the golden mean, to which the ratio of successive members of these converges.  FTP, name this sequence created to model multiplication of rabbits and having as its first few terms 1, 1, 2, 3, 5.
Matiyasevich showed that these can be defined by a Diophantine equation, leading to a proof of the insolubility of Hilbert's tenth problem.  
Fibonacci numbers or sequence