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 A077323 #10 May 30 2023 07:43:23 %S A077323 2,5,19,41,101,103,337,353,433,461,991,673,1301,1163,1801,1873,3061, %T A077323 2053,4219,3121,4159,3301,5659,4153,6151,5981,8263,6329,10267,6361, %U A077323 14323,9697,11287,10303,14281,10729,19759,14593,17863,15761,22961,14407 %N A077323 Final terms of rows of A077321. %p A077323 A077323 := proc(nmax) local n,a,T,i,p ; T := [] ; a := [] ; n :=1 ; while nops(a) < nmax do for i from 1 to n do p := 2 ; while ( p in T ) or (p-1) mod n <> 0 do p := nextprime(p) ; od ; T := [op(T),p] ; if i = n then a := [op(a),p] ; fi ; od ; n := n+1 ; od ; RETURN(a) ; end: A077323(50) ; # _R. J. Mathar_, Feb 03 2007 %t A077323 nrows = 42; %t A077323 A077321[nmax_] := Module[{n = 1, a = {}, i, p}, While[Length[a] < nmax, For[i = 1, i <= n, i++, p = 2; While[MemberQ[a, p] || Mod[p - 1, n] != 0, p = NextPrime[p]]; a = Append[a, p]]; n = n + 1]; Return[a]]; %t A077323 T = A077321[nmax = nrows (nrows + 1)/2]; %t A077323 a[n_] := T[[n (n + 1)/2]]; %t A077323 Table[a[n], {n, 1, nrows}] (* _Jean-François Alcover_, May 30 2023, after _R. J. Mathar_ *) %Y A077323 Cf. A077321, A077322, A077324, A077325. %K A077323 nonn %O A077323 1,1 %A A077323 _Amarnath Murthy_, Nov 04 2002 %E A077323 Corrected and extended by _R. J. Mathar_, Feb 03 2007