This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227672 Number of lattice paths from {n}^10 to {0}^10 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_10) we have abs(p_{i}-p_{i+1}) <= 1. 2
 1, 3628800, 126651310675680, 5140671157605632743040, 216245142312150285990621189096, 9200010705455824278689045306643126144, 392997779138060823651445903318712755280168960, 16812841813975825541536765059695075768059296587720768 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..50 EXAMPLE a(10) = 10! = 3628800. CROSSREFS Column k=10 of A227655. Cf. A000142. Sequence in context: A228913 A179065 A213872 * A172540 A071552 A181726 Adjacent sequences:  A227669 A227670 A227671 * A227673 A227674 A227675 KEYWORD nonn AUTHOR Alois P. Heinz, Jul 19 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 23:15 EST 2019. Contains 319251 sequences. (Running on oeis4.)