|
Search: id:A135493
|
|
|
| A135493 |
|
Number of ways to toss a coin n times and not get a run of six. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=a(n-1)+a(n-2)+a(n-3)+a(n-4)+a(n-5)
O.g.f.: -2-2/(-1+x+x^2+x^3+x^4+x^5) . a(n) = 2*A001591(n+4). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 10 2008
|
|
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 (rgwv(AT)rgwv.com), Feb 10 2008
|
|
CROSSREFS
|
a(n)=2*A001591(n+4). Cf. A135491, A135492.
Sequence in context: A078389 A059173 A027560 this_sequence A111663 A054043 A052396
Adjacent sequences: A135490 A135491 A135492 this_sequence A135494 A135495 A135496
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
James R FitzSimons (cherry(AT)getnet.net), Feb 07 2008
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 10 2008
|
|
|
Search completed in 0.002 seconds
|
