A202818 The left-hand half-triangle of A202691.
1, 1, 0, 2, 3, 3, 8, 6, 3, 0, 40, 48, 54, 57, 57, 256, 216, 168, 114, 57, 0
Offset: 1
Examples
Triangle begins: 1 1 0 2 3 3 8 6 3 0 40 48 54 57 57 256 216 168 114 57 0
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.
Triangle begins: 1 1 0 2 3 3 8 6 3 0 40 48 54 57 57 256 216 168 114 57 0
Triangle begins: 0 1 1 2 1 0 8 10 11 11 40 32 22 11 0 256 296 328 350 361 361
Triangle begins:
1 1
0 1 1 2
4 4 3 3 2 0
0 4 8 11 11 14 16 16
80 80 76 68 57 57 46 32 16 0
0 80 160 236 304 361 361 418 464 496 512 512
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))));}
tabf(nn) = {for (n=1, nn, for (k=-n, n, if (k, print1(T(n, k), ", "));); print;);} \\ Michel Marcus, Jun 03 2020
Triangle begins
0 1
0 0 0 1
1 1 1 1 1 0
0 1 2 3 3 4 5 5
23 23 22 20 17 17 14 10 5 0
0 23 46 68 88 105 105 122 136 146 151 151
T(n,k) = {if ((k==0), return(0)); if (n==1, if (abs(k)==1, if (k>0, return(1), return (0)))); 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))));}
tabf(nn) = {for (n=1, nn, for (k=-n, n, if (k, print1(T(n, k), ", "));); print;);} \\ Michel Marcus, Jun 03 2020
Comments