login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263063 Number of lattice paths from {8}^n to {0}^n using steps that decrement one or more components by one. 2

%I #8 Mar 23 2016 04:55:10

%S 1,1,265729,3776339263873,756051015055329306625,

%T 1100327453912286201909924526081,

%U 7835213566547395052871069325808866414849,209691630817770382144439647416526247292909726379393,17469051230066445323872793284679234619523576313653708533767425

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

%H Alois P. Heinz, <a href="/A263063/b263063.txt">Table of n, a(n) for n = 0..50</a>

%F a(n) ~ sqrt(8*Pi) * (8^7/7!)^n * n^(8*n+1/2) / (16 * exp(8*n) * (log(2))^(8*n+1)). - _Vaclav Kotesovec_, Mar 23 2016

%t With[{r = 8}, 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 Row n=8 of A262809.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 08 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:18 EDT 2024. Contains 371960 sequences. (Running on oeis4.)