login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350843 The least number of terms needed in the Taylor series approximation of arctan(1/239) such that Machin's formula with n terms in the Taylor series approximation of arctan(1/5) achieves the most correct digits of Pi. 1
1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Machin's formula states that Pi/4 = 4*arctan(1/5) - arctan(1/239). An approximation of Pi can be found by computing this using a Taylor series approximation of arctan. If n terms are used in the approximation of arctan(1/5), then a(n) is the least number of terms that can be used in the approximation of arctan(1/239) to get the largest possible number of correct digits of Pi.
LINKS
Matthew Scroggs, Python code
Wikipedia, John Machin
EXAMPLE
When using 5 terms in the Taylor series expansion of arctan(1/5) and 2 terms in the expansion of arctan(1/239), Machin's formula gives 3.141592682405... which is correct to 7 decimal places. If more than 2 terms are used in the second expansion, no more correct digits are obtained. If fewer than 2 terms are used, fewer correct digits will be obtained. Therefore a(5) = 2.
CROSSREFS
A350799(n) is the number of decimal places that will be correct when n terms are used for arctan(1/5) and a(n) terms are used for arctan(1/239).
Sequence in context: A060065 A057356 A172274 * A183138 A020913 A025787
KEYWORD
nonn,base,more
AUTHOR
Matthew Scroggs, Jan 18 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 19:20 EDT 2024. Contains 374875 sequences. (Running on oeis4.)