This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A144188 #10 Feb 04 2019 14:14:45
%S A144188 1,1,2,5,16,62,286,1519,9184,62000,463964,3800684,33911424,326678010,
%T A144188 3385261194,37492199549,442541571936,5539379635136,73368335117584,
%U A144188 1024178393797764,15041551052243448,231665680071392900,3736363255881557460,62935656581952683960
%N 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.
%H A144188 Alois P. Heinz, <a href="/A144188/b144188.txt">Table of n, a(n) for n = 0..474</a> (first 31 terms from Jan Kristian Haugland)
%F A144188 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).
%K A144188 nonn
%O A144188 0,3
%A A144188 _Jan Kristian Haugland_, Sep 13 2008