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!)
 A050233 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
 0, 0, 0, 0, 1, 3, 8, 20, 48, 112, 255, 571, 1262, 2760, 5984, 12880, 27553, 58631, 124192, 262008, 550800, 1154256, 2412031, 5027575, 10455246, 21697060, 44940472, 92920992, 191818561, 395386763, 813872712, 1673157228 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS a(n-1) is the number of compositions of n with at least one part >= 6. - Joerg Arndt, Aug 06 2012 REFERENCES Feller, W. An Introduction to Probability Theory and Its Application, Vol. 1, 2nd ed. New York: Wiley, p. 300, 1968. LINKS T. D. Noe, Table of n, a(n) for n = 1..300 Eric Weisstein's World of Mathematics, Run. Index entries for linear recurrences with constant coefficients, signature (3,-1,-1,-1,-1,-2). FORMULA a(n) = 2^(n+1) - pentanacci(n+6), cf. A001591. - Vladeta Jovovic, Feb 23 2003 G.f.:x^5/((1-2*x)*(1-x-x^2-x^3-x^4-x^5)) - Geoffrey Critzer, Jan 29 2009 MATHEMATICA 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 *) LinearRecurrence[{3, -1, -1, -1, -1, -2}, {0, 0, 0, 0, 1, 3}, 40] (* Harvey P. Dale, Jan 27 2015 *) PROG (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 CROSSREFS Cf. A008466, A050231, A050232. Sequence in context: A026712 A308370 A050232 * A143662 A151975 A049610 Adjacent sequences:  A050230 A050231 A050232 * A050234 A050235 A050236 KEYWORD nonn,nice,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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 29 17:04 EDT 2020. Contains 337432 sequences. (Running on oeis4.)