This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073597 Write Pi=3.d(1)d(2)d(3)....... where d(m) is the m-th digit of the decimal expansion of Pi. Then a(n)=m is the smallest integer such that 1/(n+1)< 0.d(m)d(m+1)d(m+2).....< 1/n. 0
 3, 1, 5, 15, 36, 2, 109, 93, 48, 53, 76, 64, 286, 96, 70, 780, 49, 365, 442, 774, 374, 269, 908, 1172, 1911, 194, 356, 84, 723, 2566, 856, 3100, 1043, 31, 158, 556, 163, 3118, 1745, 290 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n)=m is solution to n = floor(1/frac(10^m*Pi)) CROSSREFS Sequence in context: A291665 A181836 A124740 * A104053 A187369 A039512 Adjacent sequences:  A073594 A073595 A073596 * A073598 A073599 A073600 KEYWORD base,nonn AUTHOR Benoit Cloitre, Aug 29 2002 STATUS approved

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

Last modified October 19 15:50 EDT 2019. Contains 328223 sequences. (Running on oeis4.)