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!)
A091930 Write Pi = Sum_{n>=1} 1/sqrt(a(n)), where each a(n) is minimal and unique and the sum approaches Pi from below. 0
1, 2, 3, 4, 8, 77929, 17700337092966627, 97049570583433629023486339792437254323980677153951, 5843929411147236787850533935034401259024361461871518737494060444501523486808548249023180720047062910088805381472125716317734317997138497838459864230713 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The first eight terms give Pi accurately to the first 75 decimal digits.
LINKS
FORMULA
a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 4; a(n) = ceiling((Pi - Sum_{i=1..n-1}(1/sqrt(a(i))))^-2).
EXAMPLE
Pi > 1/sqrt(1) + 1/sqrt(2) + 1/sqrt(3) + 1/sqrt(4) + 1/sqrt(8), but Pi < 1/sqrt(1) + 1/sqrt(2) + 1/sqrt(3) + 1/sqrt(4) + 1/sqrt(7).
MATHEMATICA
a[1] = 1; a[2] = 2; a[3] = 3; a[4] = 4; a[n_] := Ceiling[(Pi - Sum[1/Sqrt[a[i]], {i, 1, n - 1}])^-2]; Table[ a[n], {n, 1, 9}]
CROSSREFS
Cf. A000796.
Sequence in context: A217353 A258194 A033554 * A124526 A124418 A175177
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Feb 13 2004
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 April 16 02:53 EDT 2024. Contains 371696 sequences. (Running on oeis4.)