摘要
R. L. Graham and H. O. Pollak observed that the sequence
u(1) = 1, u(n+1) = left perpendicular root 2 (u(n) + 1/2) right perpendicular, n >= 1,
has the curious property that the sequence of numbers (U(2n+1) - 2u(2n-1))(n >= 1) gives the binary digits of root 2. We present an extension of the Graham-Pollak sequence which allows us to get-in a fancy way-the binary digits of 759250125 root 2 and other numbers.
- 出版日期2010-9