login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A135493
Number of ways to toss a coin n times and not get a run of six.
5
2, 4, 8, 16, 32, 62, 122, 240, 472, 928, 1824, 3586, 7050, 13860, 27248, 53568, 105312, 207038, 407026, 800192, 1573136, 3092704, 6080096, 11953154, 23499282, 46198372, 90823608, 178554512, 351028928, 690104702, 1356710122, 2667221872
OFFSET
1,1
FORMULA
a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5).
From R. J. Mathar, Feb 10 2008: (Start)
O.g.f.: -2 - 2/(-1+x+x^2+x^3+x^4+x^5).
a(n) = 2*A001591(n+4). (End)
MATHEMATICA
a[n_] := a[n] = a[n - 1] + a[n - 2] + a[n - 3] + a[n - 4] + a[n - 5]; a[1] = 2; a[2] = 4; a[3] = 8; a[4] = 16; a[5] = 32; Array[a, 33] (* Robert G. Wilson v, Feb 10 2008 *)
LinearRecurrence[{1, 1, 1, 1, 1}, {2, 4, 8, 16, 32}, 25] (* G. C. Greubel, Oct 15 2016 *)
CROSSREFS
Sequence in context: A355520 A274005 A027560 * A216241 A283837 A111663
KEYWORD
nonn
AUTHOR
James R FitzSimons (cherry(AT)getnet.net), Feb 07 2008
EXTENSIONS
More terms from Robert G. Wilson v, Feb 10 2008
STATUS
approved