The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227671 Number of lattice paths from {n}^9 to {0}^9 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_9) we have abs(p_{i}-p_{i+1}) <= 1. 2
 1, 362880, 914570667792, 2618225365541294080, 7716228754248308194763776, 22936896882912935631904962898880, 68371528221534300846360580266415146176, 203989890816333447880297347963799273322740544, 608787871679690303320891056934368872583827110376320 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..100 EXAMPLE a(1) = 9! = 362880. CROSSREFS Column k=9 of A227655. Cf. A000142. Sequence in context: A246617 A246220 A160319 * A172536 A287085 A071551 Adjacent sequences:  A227668 A227669 A227670 * A227672 A227673 A227674 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 December 4 19:40 EST 2021. Contains 349526 sequences. (Running on oeis4.)