Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135492
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135492 Number of ways to toss a coin n times and not get a run of five. +0
3
2, 4, 8, 16, 30, 58, 112, 216, 416, 802, 1546, 2980, 5744, 11072, 21342, 41138, 79296, 152848, 294624, 567906, 1094674, 2110052, 4067256, 7839888, 15111870, 29129066, 56148080, 108228904, 208617920, 402123970, 775118874, 1494089668, 2879950432 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=a(n-1)+a(n-2)+a(n-3)+a(n-4)

MATHEMATICA

a[n_] := a[n] = a[n - 1] + a[n - 2] + a[n - 3] + a[n - 4]; a[1] = 2; a[2] = 4; a[3] = 8; a[4] = 16; Array[a, 33] - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 10 2008

CROSSREFS

a(n)=2*A000078(n+3). Cf. A135491, A135493.

Sequence in context: A164180 A164179 A027559 this_sequence A164191 A164193 A164192

Adjacent sequences: A135489 A135490 A135491 this_sequence A135493 A135494 A135495

KEYWORD

nonn

AUTHOR

James R FitzSimons (cherry(AT)getnet.net), Feb 07 2008

EXTENSIONS

Corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 10 2008

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research