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!)
A229267 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component or all components by 1. 3
1, 1, 13, 2371, 67982041, 629799991355641, 2672932604015450235911761, 7364217994146042440421602767480184881, 18165821273625565354157327818616137066973745155992321, 53130704578476340997304138835621075610747224340706918846011664495415681 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Sum_{j=0..n} multinomial(n+(n-1)*j; n-j, {j}^n) for n>1, a(0) = a(1) = 1.
EXAMPLE
a(2) = 3*3 + 2*2 = 13:
. (0,2)
. / \
. (1,2)-------(0,1)
. / \ / \
(2,2)-------(1,1)-------(0,0)
. \ / \ /
. (2,1)-------(1,0)
. \ /
. (2,0)
MAPLE
with(combinat):
a:= n-> `if`(n<2, 1, add(multinomial(n+(n-1)*j, n-j, j$n), j=0..n)):
seq(a(n), n=0..10);
MATHEMATICA
multinomial[n_, k_List] := n!/Times @@ (k!); a[n_] := If[n < 2, 1, Sum[multinomial[n+(n-1)*j, Join[{n-j}, Array[j&, n]]], {j, 0, n}]]; Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Dec 27 2013, translated from Maple *)
CROSSREFS
Main diagonal of A229142.
Sequence in context: A221901 A096721 A301466 * A350308 A283099 A348817
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 23 2013
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.

License Agreements, Terms of Use, Privacy Policy. .

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