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 A077322 #10 May 30 2023 07:43:19 %S A077322 2,3,7,17,11,43,113,89,109,131,23,157,53,449,571,593,647,487,761,821, %T A077322 1303,1013,47,1033,1451,1613,2539,1373,59,1831,2543,1889,3499,3299, %U A077322 2591,2557,149,4637,6163,3761,83,4243,173,3917,6571,5843,283,4273,5783,6551 %N A077322 Initial terms of rows of A077321. %p A077322 A077322 := 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 = 1 then a := [op(a),p] ; fi ; od ; n := n+1 ; od ; RETURN(a) ; end: A077322(50) ; # _R. J. Mathar_, Feb 03 2007 %t A077322 nrows = 50; %t A077322 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 A077322 T = A077321[nmax = (nrows^2 - nrows + 2)/2]; %t A077322 a[n_] := T[[(n^2 - n + 2)/2]]; %t A077322 Table[a[n], {n, 1, nrows}] (* _Jean-François Alcover_, May 30 2023, after _R. J. Mathar_ *) %Y A077322 Cf. A077321, A077323, A077324, A077325. %K A077322 nonn %O A077322 1,1 %A A077322 _Amarnath Murthy_, Nov 04 2002 %E A077322 More terms from _R. J. Mathar_, Feb 03 2007