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.
n, where [k]_n = k(k-1)(k-2)...(k-n+1). Therefore for n >= 2, a(n) = - Sum's wiki page.
n, where [k]_n = k(k-1)(k-2)...(k-n+1). Therefore for n >= 2, a(n) = - Sum has authored 0 sequences.