The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A198442 Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (1,1,0) or (1,0,0). 12

%I

%S 0,0,2,3,6,8,12,15,20,24,30,35,42,48,56,63,72,80,90,99,110,120,132,

%T 143,156,168,182,195,210,224,240,255,272,288,306,323,342,360,380,399,

%U 420,440,462,483,506,528,552,575,600,624,650,675,702,728,756,783,812

%N Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (1,1,0) or (1,0,0).

%C If the sequence ends with (1,1,0) Abel wins; if it ends with (1,0,0) Kain wins.

%C Abel(n) = A002620(n-1) = (2*n*(n - 2) + 1 - (-1)^n)/8.

%C Kain(n) = A004526(n-1) = floor((n - 1)/2).

%C Win probability for Abel = sum(Abel(n)/2^n) = 2/3.

%C Win probability for Kain = sum(Kain(n)/2^n) = 1/3.

%C Mean length of the game = sum(n*a(n)/2^n) = 16/3.

%C Essentially the same as A035106. - _R. J. Mathar_, Oct 27 2011

%C The sequence 2*a(n) is denoted as chi(n) by McKee (1994) and is the degree of the division polynomial f_n as a polynomial in x. He notes that "If x is given weight 1, a is given weight 2, and b is given weight 3, then all the terms in f_n(a, b, x) have weight chi(n)". - _Michael Somos_, Jan 09 2015

%D A. Engel, Wahrscheinlichkeitsrechnung und Statistik, Band 2, Klett, 1978, pages 25-26.

%H Vincenzo Librandi, <a href="/A198442/b198442.txt">Table of n, a(n) for n = 1..10000</a>

%H J. McKee, <a href="http://dx.doi.org/10.2307/2153297">Computing division polynomials</a>, Math. Comp. 63 (1994), 767-771. MR1248973 (95a:11110)

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-2,1).

%F a(n) = (2*n^2 - 5 - 3*(-1)^n)/8.

%F a(2*n) = n^2 - 1; a(2*n+1) = n*(n + 1).

%F a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) with n>=4.

%F G.f.: x^3*(2 - x)/((1 + x)*(1 - x)^3). - _R. J. Mathar_, Oct 27 2011

%F a(n) = a(-n) for all n in Z. a(0) = -1. - _Michael Somos_, Jan 09 2015

%F 0 = a(n)*(+a(n+1) - a(n+2)) + a(n+1)*(-1 - a(n+1) + a(n+2)) for all n in Z. - _Michael Somos_, Jan 09 2015

%F 1 = a(n) - a(n+1) - a(n+2) + a(n+3), 2 = a(n) - 2*a(n+2) + a(n+4) for all n in Z. - _Michael Somos_, Jan 09 2015

%F a(n) = A002620(n+2) - A052928(n+2) for n >= 1. (Note A265611(n) = A002620(n+1) + A052928(n+1) for n >= 1.) - _Peter Luschny_, Dec 22 2015

%F a(n+1) = A110654(n)^2 + A110654(n)*(2 - (n mod 2)), n >= 0. - _Fred Daniel Kline_, Jun 08 2016

%F a(n) = A004526(n)*A004526(n+3). - _Fred Daniel Kline_, Aug 04 2016

%F a(n) = floor((n^2 - 1)/4). - _Bruno Berselli_, Mar 15 2021

%e For n = 6 the a(6) = 8 solutions are (0,0,0,1,1,0), (0,1,0,1,1,0),(0,0,1,1,1,0), (1,0,1,1,1,0), (0,1,1,1,1,0),(1,1,1,1,1,0) for Abel and

%e (0,0,0,1,0,0), (0,1,0,1,0,0) for Kain.

%e G.f. = 2*x^3 + 3*x^4 + 6*x^5 + 8*x^6 + 12*x^7 + 15*x^8 + 20*x^9 + ...

%p for n from 1 by 2 to 99 do

%p a(n):=(n^2-1)/4:

%p a(n+1):=(n+1)^2/4-1:

%p end do:

%p seq(a(n),n=1..100);

%t a[ n_] := Quotient[ n^2 - 1, 4]; (* _Michael Somos_, Jan 09 2015 *)

%o (Perl) sub a {

%o my (\$t, \$n) = (0, shift);

%o for (0..((1<<\$n)-1)) {

%o my \$str = substr unpack("B32", pack("N", \$_)), -\$n;

%o \$t++ if (\$str =~ /1.0\$/ and not \$str =~ /1.0./);

%o }

%o return \$t

%o } # _Charles R Greathouse IV_, Oct 26 2011

%o (PARI) a(n)=([1,1,0,0,0,0;0,0,1,1,0,0;0,1,0,0,1,0;0,0,0,1,1,0;0,0,0,0,0,2;0,0,0,0,0,2]^n)[1,5] \\ _Charles R Greathouse IV_, Oct 26 2011

%o (PARI) {a(n) = (n^2 - 1) \ 4}; /* _Michael Somos_, Jan 09 2015 */

%o (MAGMA) [(2*n^2-5-3*(-1)^n)/8: n in [1..60]]; // _Vincenzo Librandi_, Oct 28 2011

%o (Sage)

%o def A198442():

%o yield 0

%o x, y = 0, 2

%o while True:

%o yield x

%o x, y = x + y, x//y + 1

%o a = A198442(); print([next(a) for i in range(57)]) # _Peter Luschny_, Dec 22 2015

%Y Cf. A000004, A002620, A004526, A004652, A005843, A008585, A008586, A023443, A028242, A047221, A047336, A052928, A242477, A265611.

%Y Cf. A035106, A079524, A238377.

%K nonn,easy

%O 1,3

%A _Paul Weisenhorn_, Oct 25 2011

%E a(12) inserted by _Charles R Greathouse IV_, Oct 26 2011

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 August 3 07:58 EDT 2021. Contains 346435 sequences. (Running on oeis4.)