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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263071 Number of lattice paths from {9}^n to {0}^n using steps that decrement one or more components by one. 2
 1, 1, 1462563, 191731486403293, 496505991344667030490635, 12024609569670508078686022988554381, 1742079663955078309800553960117733249663480043, 1121241285685659360225420876424590015281785102622410968973 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..50 FORMULA 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 MATHEMATICA 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 *) CROSSREFS Row n=9 of A262809. Sequence in context: A364782 A205044 A237314 * A204801 A234837 A233391 Adjacent sequences: A263068 A263069 A263070 * A263072 A263073 A263074 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 08 2015 STATUS approved

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.

Last modified September 23 17:20 EDT 2023. Contains 365554 sequences. (Running on oeis4.)