|
|
A198834
|
|
Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (0,1,1) or (1,1,1).
|
|
1
|
|
|
0, 0, 2, 2, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634, 78176338
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
If the sequence ends with (011) Abel wins; if it ends with (111) Kain wins.
Kain(n)=0 for n <> 3; Kain(3)=1.
Win probability for Abel: Sum_{n>=1} Abel(n)/2^n = 7/8.
Win probability for Kain: Kain(3)/8 = 1/8.
Mean length of the game: Sum_{n>=1} n*a(n)/2^n = 7.
|
|
REFERENCES
|
A. Engel, Wahrscheinlichkeit und Statistik, Band 2, Klett, 1978, pages 25-26.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) + a(n-2) for n > 3.
G.f.: 2*x^3/(1 - x - x^2).
E.g.f.: 2 - 2*x + 2*exp(x/2)*(3*sqrt(5)*sinh(sqrt(5)*x/2) - 5*cosh(sqrt(5)*x/2))/5. - Stefano Spezia, Feb 19 2023
|
|
EXAMPLE
|
For n=6 the a(6)=6 solutions are (0,0,0,0,1,1), (1,0,0,0,1,1); (0,1,0,0,1,1), (1,1,0,0,1,1), (0,0,1,0,1,1), (1,0,1,0,1,1) all for Abel.
|
|
MAPLE
|
a(1):=0: a(2):=0: a(3):=2:
ml:=0.75: pot:=8:
for n from 4 to 100 do
pot:=2*pot:
a(n):=a(n-1)+a(n-2):
ml:=ml+n*a(n)/pot:
end do:
printf("%12.8f", ml);
seq(a(n), n=1..100);
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|