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.

A202815 The right-hand half-triangle of A185356 (or A202690).

This page as a plain text file.
%I A202815 #10 Jun 03 2020 03:45:17
%S A202815 1,1,2,3,2,0,11,14,16,16,57,46,32,16,0,361,418,464,496,512,512,2763,
%T A202815 2402,1984,1520,1024,512,0,24611,27374,29776,31760,33280,34304,34816,
%U A202815 34816,250737,226126,198752,168976,137216,103936,69632,34816,0
%N A202815 The right-hand half-triangle of A185356 (or A202690).
%H A202815 M. Josuat-Vergès, J.-C. Novelli and J.-Y. Thibon, <a href="http://arxiv.org/abs/1110.5272">The algebraic combinatorics of snakes</a>, arXiv preprint arXiv:1110.5272 [math.CO], 2011.
%e A202815 Triangle begins:
%e A202815     1
%e A202815     1   2
%e A202815     3   2   0
%e A202815    11  14  16  16
%e A202815    57  46  32  16   0
%e A202815   361 418 464 496 512 512
%e A202815   ...
%o A202815 (PARI) T(n,k) = {if ((k==0), return(0)); if (n==1, if (abs(k)==1, return(1))); if (n%2, if (k<0, sum(j=k+1, n-1, T(n-1,j)), sum(j=k, n-1, T(n-1,j))), if (k<0, sum(j=-n+1, k, T(n-1,j)), sum(j=-n+1, k-1, T(n-1,j))));}
%o A202815 tabl(nn) = {for (n=1, nn, for (k=1, n, if (k, print1(T(n, k), ", "));); print;);} \\ _Michel Marcus_, Jun 03 2020
%Y A202815 Cf. A185356, A202690, A202816.
%K A202815 nonn,tabl
%O A202815 1,3
%A A202815 _N. J. A. Sloane_, Dec 25 2011
%E A202815 More terms from _Michel Marcus_, Jun 03 2020