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.

A158747 Triangle read by rows: T(n,m)=prime( 1+prime(n+1)-prime(m+1) ).

Original entry on oeis.org

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, 11, 2, 61, 59, 47, 41, 23, 17, 5, 2, 79, 73, 67, 59, 41, 31, 17, 11, 2, 107, 103, 97, 83, 67, 59, 41, 31, 17, 2, 113, 109, 103, 97, 73, 67, 47, 41, 23, 5, 2
Offset: 0

Views

Author

Roger L. Bagula, Mar 25 2009

Keywords

Comments

The row sums are {2, 5, 14, 31, 82, 115, 202, 255, 380, 607, 680,...}.

Examples

			{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, 11, 2},
{61, 59, 47, 41, 23, 17, 5, 2},
{79, 73, 67, 59, 41, 31, 17, 11, 2},
{107, 103, 97, 83, 67, 59, 41, 31, 17, 2},
{113, 109, 103, 97, 73, 67, 47, 41, 23, 5, 2}
		

Programs

  • Mathematica
    Clear[t, n, m];
    t[n_, m_] = Prime[Prime[n + 1] - Prime[m + 1] + 1];
    Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];
    Flatten[%]

Formula

T(n,m)=A000040( 1+A000040(n+1)-A000040(m+1) ) = A000040(1+A086800(n,m)), 0<=n, 0<=m<=n.

Extensions

Edited by the Associate Editors of the OEIS, Apr 22 2009