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.

A362779 Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.

This page as a plain text file.
%I A362779 #12 Jun 25 2023 01:03:19
%S A362779 2,3,5,7,13,19,5,7,73,97,11,241,19,37,601,103,131,2161,67,277,149,71,
%T A362779 593,15121,20161,79,30241,35281,661,7331,1657,161281,449,241921,
%U A362779 282241,6863,269,2477,1088641,1451521,78887,2177281,5281,2903041,192113,329891,29383,10886401,62297,18144001,2243,251501,29030401,32659201,843907
%N A362779 Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.
%C A362779 The primes in each row are distinct because n!*k + 1 are coprime for 1 <= k <= n, and hence this array gives a simple proof that there are infinitely many prime numbers.
%F A362779 T(n,k) = A006530(A362777(n,k))
%e A362779 Triangle T(n,k) begins:
%e A362779   n\k   1    2    3    4    5    6 ...
%e A362779   1     2
%e A362779   2     3    5
%e A362779   3     7   13   19
%e A362779   4     5    7   73   97
%e A362779   5    11  241   19   37  601
%e A362779   6   103  131 2161   67  277  149
%e A362779   ...
%Y A362779 Cf. A362777, A362778.
%Y A362779 Cf. A002583 (1st column).
%K A362779 tabl,nonn
%O A362779 1,1
%A A362779 _Joe B. Stephen_, May 03 2023