|
| |
|
|
A057703
|
|
Answer to the question: if you have a tall building and 5 plates and you need to find the highest story, a plate thrown from which does not break, what is the number of stories you can handle given n tries?
|
|
5
| |
|
|
0, 1, 3, 7, 15, 31, 62, 119, 218, 381, 637, 1023, 1585, 2379, 3472, 4943, 6884, 9401, 12615, 16663, 21699, 27895, 35442, 44551, 55454, 68405, 83681, 101583, 122437, 146595, 174436, 206367, 242824, 284273, 331211, 384167, 443703, 510415, 584934, 667927
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
REFERENCES
| Michael Boardman, "The Egg-Drop Numbers", Mathematics Magazine, 77 (2004), 368-372. [From Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Sep 30 2009]
|
|
|
FORMULA
| a(n) = n^5/120-n^4/24+5*n^3/24+n^2/24+47*n/60
a(n)=C[n, 5]+C[n, 4]+C[n, 3]+C[n, 2]+C[n, 1]. - Labos E. (labos(AT)ana.sote.hu)
|
|
|
MAPLE
| seq(sum(binomial(n, k), k=1..5), n=0..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 13 2007
|
|
|
MATHEMATICA
| LinearRecurrence[{6, -15, 20, -15, 6, -1}, {0, 1, 3, 7, 15, 31}, 60] (* From Vladimir Joseph Stephan Orlovsky, Feb 08 2012 *)
|
|
|
CROSSREFS
| Cf. A004006. Differences form A055795 + 1 = A000127.
Sequence in context: A006778 A007574 A034480 * A006739 A119407 A043734
Adjacent sequences: A057700 A057701 A057702 * A057704 A057705 A057706
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Leonid Broukhis (leob(AT)mailcom.com), Oct 24 2000
|
|
|
EXTENSIONS
| More terms and formula from James A. Sellers (sellersj(AT)math.psu.edu), Oct 25 2000
|
| |
|
|
