On the minimal elements for the sequence of all powers in the Lemoine-Kátai algorithm
Jukka Pihko · Mathematics of Computation · 1993
It is proved, with the help of a computer, that for m = 20 m = 20 the first m minimal elements for the sequence of all powers in an integer-representing algorithm are given by y i = i , i = 1 , 2 , 3 , y i + 1 = ( y i 2 + 6 y i + 1 ) / 4 , i = 3 , … , m − 1 {y_i} = i,i = 1,2,3,{y_{i + 1}} = (y_i^2 + 6{y_i} + 1)/4,i = 3, \ldots ,m - 1 . This extends an earlier result of the author (for m = 10 m = 10 ).