|
Search: id:A108758
|
|
|
| A108758 |
|
a(n)=2*a(n-1)-a(n-4)+a(n-5) with a(-2)=a(-1)=a(0)=1, a(1)=2, a(2)=4, a(3)=7. |
|
+0
1
|
|
| 1, 1, 1, 2, 4, 7, 14, 27, 52, 101, 195, 377, 729, 1409, 2724, 5266, 10180, 19680, 38045, 73548, 142182, 274864, 531363, 1027223, 1985812, 3838942, 7421385, 14346910, 27735231, 53617332, 103652221, 200378917, 387369513, 748856925, 1447678961
(list; graph; listen)
|
|
|
OFFSET
|
-2,4
|
|
|
COMMENT
|
An unbiased coin is tossed n times and the resulted sequence of heads and tails is written linearly. Number of strings out of 2^n posiible strings, having no three consecutive heads (HHH's) is given by the above sequence (with suitable offset).
Starting (1, 1, 2, 4, 7,...) = INVERT transform of (1, 1, 0, 1, 1, 1, 1,...). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 27 2009]
|
|
MATHEMATICA
|
a[n_] := a[n] = 2a[n - 1] - a[n - 4] + a[n - 5]; a[ -2] = a[ -1] = a[0] = 1; a[1] = 2; a[2] = 4; a[3] = 7; Table[ a[n], {n, 0, 32}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 25 2005)
|
|
CROSSREFS
|
Sequence in context: A123196 A079968 A001631 this_sequence A018085 A167751 A107949
Adjacent sequences: A108755 A108756 A108757 this_sequence A108759 A108760 A108761
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Mrs. J. P. Shiwalkar (jyotishiwalkar(AT)rediffmail.com) and M. N. Deshpande (dpratap_ngp(AT)sancharnet.in), Jun 24 2005
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 25 2005
|
|
|
Search completed in 0.006 seconds
|
