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!)
A246771 Decimal expansion of the success probability associated with the optimal stopping problem on patterns in random binary strings. 0
6, 1, 9, 2, 5, 2, 2, 7, 0, 9, 8, 4, 8, 8, 4, 9, 0, 8, 6, 6, 3, 2, 8, 0, 7, 1, 8, 1, 9, 3, 7, 5, 2, 6, 6, 7, 4, 2, 3, 0, 8, 8, 7, 7, 1, 9, 0, 2, 4, 0, 9, 5, 0, 1, 0, 3, 4, 0, 4, 7, 8, 5, 2, 1, 7, 1, 5, 0, 3, 7, 3, 2, 6, 9, 2, 1, 8, 7, 7, 3, 7, 8, 1, 3, 9, 8, 3, 6, 6, 3, 0, 3, 8, 4, 9, 3, 7, 0, 0, 5, 8, 8, 2, 5 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
p = (2/135)*exp(-beta)*(4 - 45*beta^2 + 45*beta^3), where beta = A246770 = the largest root of 45*x^3 - 180*x^2 + 90*x + 4.
EXAMPLE
0.619252270984884908663280718193752667423088771902409501034...
MATHEMATICA
beta = Root[45x^3 - 180*x^2 + 90*x + 4, x, 3]; p = (2/135)*Exp[-beta]*(4 - 45*beta^2 + 45*beta^3); RealDigits[p, 10, 104] // First
CROSSREFS
Cf. A246770.
Sequence in context: A117236 A349141 A358968 * A176397 A245724 A021908
KEYWORD
nonn,cons,easy
AUTHOR
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 9 12:36 EDT 2024. Contains 375042 sequences. (Running on oeis4.)