login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
1, 1, 2, 5, 16, 62, 286, 1519, 9184, 62000, 463964, 3800684, 33911424, 326678010, 3385261194, 37492199549, 442541571936, 5539379635136, 73368335117584, 1024178393797764, 15041551052243448, 231665680071392900, 3736363255881557460, 62935656581952683960 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..474 (first 31 terms from Jan Kristian Haugland)
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: A173469 A138549 A210667 * A157314 A159603 A058117
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)