cp's OEIS Frontend

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.

A262810 Number of lattice paths from {n}^n to {0}^n using steps that decrement one or more components by one.

This page as a plain text file.
%I A262810 #19 Jul 12 2018 09:44:26
%S A262810 1,1,13,16081,5552351121,1050740615666453461,
%T A262810 179349571255187154941191217629,
%U A262810 41020870889694863957061607086939138327565057,17469051230066445323872793284679234619523576313653708533767425
%N A262810 Number of lattice paths from {n}^n to {0}^n using steps that decrement one or more components by one.
%H A262810 Alois P. Heinz, <a href="/A262810/b262810.txt">Table of n, a(n) for n = 0..25</a>
%F A262810 a(n) = A262809(n,n).
%F A262810 a(n) ~ n^(n^2 - n/2 + 1) / (exp(1/12) * 2^(n + log(2)/24) * Pi^((n-1)/2) * log(2)^(n^2+1)). - _Vaclav Kotesovec_, Mar 23 2016
%e A262810 a(2) = 13: [(2,2),(1,2),(0,2),(0,1),(0,0)], [(2,2),(1,2),(0,1),(0,0)], [(2,2),(1,2),(1,1),(0,1),(0,0)], [(2,2),(1,2),(1,1),(0,0)], [(2,2),(1,2),(1,1),(1,0),(0,0)], [(2,2),(2,1),(1,1),(0,1),(0,0)], [(2,2),(2,1),(1,1),(0,0)], [(2,2),(2,1),(1,1),(1,0),(0,0)], [(2,2),(2,1),(2,0),(0,1),(0,0)], [(2,2),(2,1),(1,0),(0,0)], [(2,2),(1,1),(0,1),(0,0)], [(2,2),(1,1),(0,0)], [(2,2),(1,1),(1,0),(0,0)].
%t A262810 Flatten[{1, Table[Sum[Sum[(-1)^i*Binomial[j, i]*Binomial[j - i, n]^n, {i, 0, j}], {j, 0, n^2}], {n, 1, 10}]}] (* _Vaclav Kotesovec_, Mar 23 2016 *)
%o A262810 (PARI) a(n)=sum(j=0,n^2,sum(i=0,j, (-1)^i*binomial(j, i)*binomial(j - i, n)^n)) \\ _Charles R Greathouse IV_, Jul 29 2016
%Y A262810 Main diagonal of A262809.
%Y A262810 Cf. A316677.
%K A262810 nonn,nice
%O A262810 0,3
%A A262810 _Alois P. Heinz_, Oct 02 2015