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

This page as a plain text file.
%I A103359 #7 Sep 19 2021 08:05:30
%S A103359 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,
%T A103359 11,13,13,13,3,5,11,11,13,13,13,13,17,5,11,11,13,13,13,13,17,17,19,11,
%U A103359 11,13,13,13,13,17,17,19,19,19,3,13,13,13,13,17,17,19,19,19,19,23,13,13
%N A103359 T(n,k) = Max{p: prime p divides m where n-k<=m<=n+k}, triangle read by rows: 0<=k<n.
%C A103359 T(n,0) = A006530(n); T(n,1) = A093074(n) for n>1;
%C A103359 T(n,n-1) = A060265(n) for n>1.
%e A103359 Triangle begins:
%e A103359 1;
%e A103359 2, 3;
%e A103359 3, 3, 5;
%e A103359 2, 5, 5, 7;
%e A103359 5, 5, 7, 7, 7;
%e A103359 ...
%t A103359 T[n_, k_] := FactorInteger[#][[-1, 1]]& /@ Range[n-k, n+k] // Max;
%t A103359 Table[T[n, k], {n, 1, 13}, {k, 0, n-1}] // Flatten (* _Jean-François Alcover_, Sep 19 2021 *)
%K A103359 nonn,tabl
%O A103359 1,2
%A A103359 _Reinhard Zumkeller_, Mar 20 2005