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 A158747 #2 Mar 30 2012 17:34:35 %S A158747 2,3,2,7,5,2,13,11,5,2,29,23,17,11,2,37,31,23,17,5,2,53,47,41,31,17, %T A158747 11,2,61,59,47,41,23,17,5,2,79,73,67,59,41,31,17,11,2,107,103,97,83, %U A158747 67,59,41,31,17,2,113,109,103,97,73,67,47,41,23,5,2 %N A158747 Triangle read by rows: T(n,m)=prime( 1+prime(n+1)-prime(m+1) ). %C A158747 The row sums are {2, 5, 14, 31, 82, 115, 202, 255, 380, 607, 680,...}. %F A158747 T(n,m)=A000040( 1+A000040(n+1)-A000040(m+1) ) = A000040(1+A086800(n,m)), 0<=n, 0<=m<=n. %e A158747 {2}, %e A158747 {3, 2}, %e A158747 {7, 5, 2}, %e A158747 {13, 11, 5, 2}, %e A158747 {29, 23, 17, 11, 2}, %e A158747 {37, 31, 23, 17, 5, 2}, %e A158747 {53, 47, 41, 31, 17, 11, 2}, %e A158747 {61, 59, 47, 41, 23, 17, 5, 2}, %e A158747 {79, 73, 67, 59, 41, 31, 17, 11, 2}, %e A158747 {107, 103, 97, 83, 67, 59, 41, 31, 17, 2}, %e A158747 {113, 109, 103, 97, 73, 67, 47, 41, 23, 5, 2} %t A158747 Clear[t, n, m]; %t A158747 t[n_, m_] = Prime[Prime[n + 1] - Prime[m + 1] + 1]; %t A158747 Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; %t A158747 Flatten[%] %K A158747 nonn,tabl,easy %O A158747 0,1 %A A158747 _Roger L. Bagula_, Mar 25 2009 %E A158747 Edited by the Associate Editors of the OEIS, Apr 22 2009