login
a(n) is the number of n-tosses having a run of 5 or more heads for a fair coin (i.e., probability is a(n)/2^n).
7

%I #36 Jan 03 2021 00:55:55

%S 0,0,0,0,1,3,8,20,48,112,255,571,1262,2760,5984,12880,27553,58631,

%T 124192,262008,550800,1154256,2412031,5027575,10455246,21697060,

%U 44940472,92920992,191818561,395386763,813872712,1673157228

%N a(n) is the number of n-tosses having a run of 5 or more heads for a fair coin (i.e., probability is a(n)/2^n).

%C a(n-1) is the number of compositions of n with at least one part >= 6. - _Joerg Arndt_, Aug 06 2012

%D W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 2nd ed. New York: Wiley, p. 300, 1968.

%H T. D. Noe, <a href="/A050233/b050233.txt">Table of n, a(n) for n = 1..300</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Run.html">Run</a>.

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

%F a(n) = 2^(n+1) - pentanacci(n+6), cf. A001591. - _Vladeta Jovovic_, Feb 23 2003

%F G.f.: x^5/((1-2*x)*(1-x-x^2-x^3-x^4-x^5)). - _Geoffrey Critzer_, Jan 29 2009

%F a(n) = 3*a(n-1) - a(n-2) - a(n-3) - a(n-4) - a(n-5) - 2*a(n-6). - _Wesley Ivan Hurt_, Jan 03 2021

%t f[x_] := x^4 / (1-3x+x^2+x^3+x^4+x^5+2x^6); CoefficientList[ Series[f[x], {x, 0, 31}], x] (* _Jean-François Alcover_, Nov 18 2011 *)

%t LinearRecurrence[{3,-1,-1,-1,-1,-2},{0,0,0,0,1,3},40] (* _Harvey P. Dale_, Jan 27 2015 *)

%o (PARI) a(n)=([0,1,0,0,0,0; 0,0,1,0,0,0; 0,0,0,1,0,0; 0,0,0,0,1,0; 0,0,0,0,0,1; -2,-1,-1,-1,-1,3]^(n-1)*[0;0;0;0;1;3])[1,1] \\ _Charles R Greathouse IV_, Jun 15 2015

%Y Cf. A001591, A008466, A050231, A050232.

%K nonn,nice,easy

%O 1,6

%A _Eric W. Weisstein_