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 A316677 #8 Jul 10 2018 14:34:14
%S A316677 1,1,26,64324,44418808968,16811849850663255376,
%T A316677 5739186280165988958118118964128,
%U A316677 2625335736940471293251942853564104852964163648,2236038557448505001455717540438942031299017768147674692322230400
%N A316677 Number of paths from {0}^n to {n}^n that always move closer to {n}^n.
%H A316677 Alois P. Heinz, <a href="/A316677/b316677.txt">Table of n, a(n) for n = 0..25</a>
%F A316677 a(n) = A316674(n,n).
%F A316677 a(n) = A262810(n) * ceiling(2^(n-1)) = A262810(n) * A011782(n).
%Y A316677 Main diagonal of A316674.
%Y A316677 Cf. A011782, A262810.
%K A316677 nonn,walk
%O A316677 0,3
%A A316677 _Alois P. Heinz_, Jul 10 2018