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 A354485 #33 Jun 05 2022 08:32:02 %S A354485 2,2,3,3,5,7,7,19,31,43,5,11,17,23,29,7,37,67,97,127,157,7,157,307, %T A354485 457,607,757,907,881,1091,1301,1511,1721,1931,2141,2351,3499,3709, %U A354485 3919,4129,4339,4549,4759,4969,5179,199,409,619,829,1039,1249,1459,1669,1879,2089 %N A354485 Triangle read by rows: row n gives the arithmetic progression of exactly n primes with minimal final term, cf. A354376. %C A354485 For the corresponding values of the first term, the last term and the common difference of these arithmetic progressions, see respectively A354377, A354376 and A354484. %C A354485 Without "exactly", we get A133277. %C A354485 The primes in these arithmetic progressions need not be consecutive. (The smallest prime at the start of a run of exactly n consecutive primes in arithmetic progressions is A006560(n).) %D A354485 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section A5, Arithmetic progressions of primes, pp. 25-28. %H A354485 Michael S. Branicky, <a href="/A354485/b354485.txt">Table of n, a(n) for n = 1..231</a> (using A354376 and A354377) %F A354485 T(n, 1) = A354377. %F A354485 T(n, n) = A354376. %e A354485 Triangle begins: %e A354485 2; %e A354485 2, 3; %e A354485 3, 5, 7; %e A354485 7, 19, 31, 43; %e A354485 5, 11, 17, 23, 29; %e A354485 7, 37, 67, 97, 127, 157; %e A354485 7, 157, 307, 457, 607, 757, 907; %e A354485 881, 1091, 1301, 1511, 1721, 1931, 2141, 2351; %e A354485 ... %Y A354485 Cf. A006560, A133277, A354376, A354377, A354484. %K A354485 nonn,tabl %O A354485 1,1 %A A354485 _Bernard Schott_, May 29 2022