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 A263071 #8 Mar 23 2016 04:54:56
%S A263071 1,1,1462563,191731486403293,496505991344667030490635,
%T A263071 12024609569670508078686022988554381,
%U A263071 1742079663955078309800553960117733249663480043,1121241285685659360225420876424590015281785102622410968973
%N A263071 Number of lattice paths from {9}^n to {0}^n using steps that decrement one or more components by one.
%H A263071 Alois P. Heinz, <a href="/A263071/b263071.txt">Table of n, a(n) for n = 0..50</a>
%F A263071 a(n) ~ 3*sqrt(Pi) * (9^8/8!)^n * n^(9*n+1/2) / (2^(9/2) * exp(9*n) * (log(2))^(9*n+1)). - _Vaclav Kotesovec_, Mar 23 2016
%t A263071 With[{r = 9}, Flatten[{1, Table[Sum[Sum[(-1)^i*Binomial[j, i]*Binomial[j - i, r]^k, {i, 0, j}], {j, 0, k*r}], {k, 1, 10}]}]] (* _Vaclav Kotesovec_, Mar 22 2016 *)
%Y A263071 Row n=9 of A262809.
%K A263071 nonn
%O A263071 0,3
%A A263071 _Alois P. Heinz_, Oct 08 2015