login
This site is supported by donations 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
1, 1, 265729, 3776339263873, 756051015055329306625, 1100327453912286201909924526081, 7835213566547395052871069325808866414849, 209691630817770382144439647416526247292909726379393, 17469051230066445323872793284679234619523576313653708533767425 (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) ~ 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

MATHEMATICA

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 *)

CROSSREFS

Row n=8 of A262809.

Sequence in context: A095974 A022202 A118062 * A043629 A234182 A075466

Adjacent sequences:  A263060 A263061 A263062 * A263064 A263065 A263066

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:02 EDT 2019. Contains 322404 sequences. (Running on oeis4.)