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

 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

%I #7 Jul 19 2013 16:14:56

%S 1,3628800,126651310675680,5140671157605632743040,

%T 216245142312150285990621189096,9200010705455824278689045306643126144,

%U 392997779138060823651445903318712755280168960,16812841813975825541536765059695075768059296587720768

%N 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.

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

%e a(10) = 10! = 3628800.

%Y Column k=10 of A227655.

%Y Cf. A000142.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jul 19 2013

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 April 14 12:23 EDT 2024. Contains 371661 sequences. (Running on oeis4.)