|
Search: id:A144188
|
|
|
| A144188 |
|
a(n)/n! is the probability of guessing "up/down" correctly through a deck of n cards marked 1, 2, ..., n, if one always makes the most probable guess. |
|
+0
1
|
|
| 1, 1, 2, 5, 16, 62, 286, 1519, 9184, 62000, 463964, 3800684, 33911424, 326678010, 3385261194, 37492199549, 442541571936, 5539379635136, 73368335117584, 1024178393797764, 15041551052243448, 231665680071392900
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Jan Kristian Haugland, Table of n, a(n) for n = 1..30
|
|
FORMULA
|
Let f(0, 0) = 1 and f(n, k) = max{f(n - 1, 0) + ... + f(n - 1, k - 1), f(n - 1, k) + ... + f(n - 1, n - 1)} for 0 <= k <= n. Then a(n) = f(n, 0).
|
|
CROSSREFS
|
Sequence in context: A129578 A005387 A138549 this_sequence A157314 A159603 A058117
Adjacent sequences: A144185 A144186 A144187 this_sequence A144189 A144190 A144191
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jan Kristian Haugland (jankrihau(AT)hotmail.com), Sep 13 2008
|
|
|
Search completed in 0.002 seconds
|
