cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A227671 #5 Jul 19 2013 17:17:26
%S A227671 1,362880,914570667792,2618225365541294080,7716228754248308194763776,
%T A227671 22936896882912935631904962898880,
%U A227671 68371528221534300846360580266415146176,203989890816333447880297347963799273322740544,608787871679690303320891056934368872583827110376320
%N 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.
%H A227671 Alois P. Heinz, <a href="/A227671/b227671.txt">Table of n, a(n) for n = 0..100</a>
%e A227671 a(1) = 9! = 362880.
%Y A227671 Column k=9 of A227655.
%Y A227671 Cf. A000142.
%K A227671 nonn
%O A227671 0,2
%A A227671 _Alois P. Heinz_, Jul 19 2013