cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A344906 Decimal expansion of Sum_{k>=0} arctan(1/2^k).

Original entry on oeis.org

1, 7, 4, 3, 2, 8, 6, 6, 2, 0, 4, 7, 2, 3, 4, 0, 0, 0, 3, 5, 0, 4, 3, 3, 7, 6, 5, 6, 1, 3, 6, 4, 1, 6, 2, 8, 5, 8, 1, 3, 8, 3, 1, 1, 8, 5, 4, 2, 8, 2, 0, 6, 5, 2, 3, 0, 0, 4, 5, 6, 9, 5, 7, 2, 0, 5, 6, 5, 5, 1, 7, 6, 5, 2, 2, 7, 4, 9, 2, 0, 5, 5, 8, 1, 6, 5, 8, 6, 8
Offset: 1

Views

Author

Daniel Hoyt, Jun 01 2021

Keywords

Comments

This number can be interpreted geometrically as the angle in radians of a fan made of stacked right triangles, with the length to height ratio doubling each successive triangle as seen in the illustration.
Since this angle exceeds Pi/2, the set of rotation angles used in the CORDIC algorithm covers an angle range sufficient to compute sine and cosine for any angle between 0 and Pi/2. This means the algorithm can converge to any angle in that range through appropriate combinations of these basic rotations. - Daniel Hoyt, Oct 25 2024

Examples

			1.743286620472340003...
		

Crossrefs

Programs

  • Maple
    Digits:= 140:
    evalf(sum(arccot(2^k), k=0..infinity));  # Alois P. Heinz, Jun 02 2021
  • PARI
    suminf(k=0, atan(1/2^k))
    
  • PARI
    sumalt(k=1, ((-1)^(k+1))*2^(2*k-1)/((2^(2*k-1)-1)*(2*k-1)))

Formula

Equals Sum_{k>=1} (-1)^(k+1)*2^(2*k-1)/((2^(2*k-1)-1)*(2*k-1)).