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.

A201161 Irregular triangle read by rows: number of colored Motzkin paths of length n and rank k.

This page as a plain text file.
%I A201161 #12 May 29 2018 16:47:26
%S A201161 1,2,1,4,2,4,8,1,4,9,12,16,2,4,12,20,30,32,32,1,4,9,20,34,56,73,88,80,
%T A201161 64,2,4,12,24,46,72,116,156,206,232,240,192,128
%N A201161 Irregular triangle read by rows: number of colored Motzkin paths of length n and rank k.
%C A201161 Perhaps the row-reversed variant of A129183. - _R. J. Mathar_, Dec 13 2011
%H A201161 Brian Drake, <a href="http://dx.doi.org/10.1016/j.disc.2008.11.020">Limits of areas under lattice paths</a>, Discrete Math. 309 (2009), no. 12, 3936-3953. See Section 4.
%e A201161 Triangle begins
%e A201161 1
%e A201161 2
%e A201161 1 4
%e A201161 2 4 8
%e A201161 1 4 9 12 16
%e A201161 2 4 12 20 30 32 32
%e A201161 1 4 9 20 34 56 73 88 80 64
%e A201161 2 4 12 24 46 72 116 156 206 232 240 192 128
%e A201161 ...
%K A201161 nonn,tabf,more
%O A201161 0,2
%A A201161 _N. J. A. Sloane_, Nov 27 2011