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.

A103359 T(n,k) = Max{p: prime p divides m where n-k<=m<=n+k}, triangle read by rows: 0<=k

Original entry on oeis.org

1, 2, 3, 3, 3, 5, 2, 5, 5, 7, 5, 5, 7, 7, 7, 3, 7, 7, 7, 7, 11, 7, 7, 7, 7, 11, 11, 13, 2, 7, 7, 11, 11, 13, 13, 13, 3, 5, 11, 11, 13, 13, 13, 13, 17, 5, 11, 11, 13, 13, 13, 13, 17, 17, 19, 11, 11, 13, 13, 13, 13, 17, 17, 19, 19, 19, 3, 13, 13, 13, 13, 17, 17, 19, 19, 19, 19, 23, 13, 13
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 20 2005

Keywords

Comments

T(n,0) = A006530(n); T(n,1) = A093074(n) for n>1;
T(n,n-1) = A060265(n) for n>1.

Examples

			Triangle begins:
1;
2, 3;
3, 3, 5;
2, 5, 5, 7;
5, 5, 7, 7, 7;
...
		

Programs

  • Mathematica
    T[n_, k_] := FactorInteger[#][[-1, 1]]& /@ Range[n-k, n+k] // Max;
    Table[T[n, k], {n, 1, 13}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Sep 19 2021 *)