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.
%I A204087 #22 Mar 12 2015 05:20:10 %S A204087 1,1,1,1,2,1,1,3,3,1,1,2,6,2,1,1,5,10,10,5,1,1,1,5,10,5,1,1,1,7,7,35, %T A204087 35,7,7,1,1,2,14,14,70,14,14,2,1,1,3,6,42,42,42,42,6,3,1,1,1,3,6,42, %U A204087 42,42,6,3,1,1,1,11,11,33,66,462,462,66,33,11,11,1 %N A204087 Reduced Pascal triangle: C_R(n,m) = A003418(n) / max(A003418(m), A003418(n-m)), m=0,...,n. %C A204087 The sixth row is the first one which differs from triangles A080381, A080396. %H A204087 Alois P. Heinz, <a href="/A204087/b204087.txt">Rows n = 0..140, flattened</a> %e A204087 Triangle begins: %e A204087 n/m.|..0.....1.....2.....3.....4.....5.....6.....7 %e A204087 ================================================== %e A204087 .0..|..1 %e A204087 .1..|..1.....1 %e A204087 .2..|..1.....2.....1 %e A204087 .3..|..1.....3.....3.....1 %e A204087 .4..|..1.....2.....6.....2.....1 %e A204087 .5..|..1.....5....10....10.....5.....1 %e A204087 .6..|..1.....1.....5....10.....5.....1.....1 %e A204087 .7..|..1.....7.....7....35....35.....7.....7.....1 %p A204087 g:= proc(n) option remember; `if`(n=0, 1, ilcm(g(n-1), n)) end: %p A204087 CR:= proc(n, m) option remember; g(n)/max(g(m), g(n-m)) end: %p A204087 seq (seq (CR(n,m), m=0..n), n=0..11); # _Alois P. Heinz_, Jan 11 2012 %t A204087 g[n_] := g[n] = If[n == 0, 1, LCM[g[n-1], n]]; CR[n_, m_] := CR[n, m] = g[n]/Max[ g[m], g[n-m]]; Table[Table[CR[n, m], {m, 0, n}], {n, 0, 11}] // Flatten (* _Jean-François Alcover_, Mar 12 2015, after _Alois P. Heinz_ *) %Y A204087 Cf. A007318, A080381, A080396, A186430, A202917, A202941. %K A204087 nonn,tabl %O A204087 0,5 %A A204087 _Vladimir Shevelev_ and _Peter J. C. Moses_, Jan 10 2012