Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A151794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A151794 a(1)=2, a(2)=4, a(3)=6; a(n+3) = a(n+2)+ 2 a(n), n>=1. +0
1
2, 4, 6, 14, 26, 54, 104 (list; graph; listen)
OFFSET

1,1

COMMENT

Consider the following coin tossing experiment. Let n >= 1 be a predetermined integer. We toss an unbiased coin sequentially. For each outcome, we score two points for a head (H) and one point for a tail (T). The coin is tossed until the total score reaches n or jumps from n-1 to n+1. The results of the tosses are written in a linear array. Then the probability of non-occurrence of double heads (HH) is given by p(n) = a(n) / 2^n , n>=1.

REFERENCES

Bhanu K. S, Deshpande M. N. & Cholkar C. P. (2006): Coin tossing -Some Surprising Results , International Journal of Mathematical Education In Science and Technology, Vol.37, No.1, pp.115-119.

CROSSREFS

Sequence in context: A032353 A062112 A084685 this_sequence A058059 A053686 A080198

Adjacent sequences: A151791 A151792 A151793 this_sequence A151795 A151796 A151797

KEYWORD

nonn,easy,more

AUTHOR

K. S. Bhanu (bhanu_105(AT)yahoo.com), Jun 21 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research