login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A077323
Final terms of rows of A077321.
5
2, 5, 19, 41, 101, 103, 337, 353, 433, 461, 991, 673, 1301, 1163, 1801, 1873, 3061, 2053, 4219, 3121, 4159, 3301, 5659, 4153, 6151, 5981, 8263, 6329, 10267, 6361, 14323, 9697, 11287, 10303, 14281, 10729, 19759, 14593, 17863, 15761, 22961, 14407
OFFSET
1,1
MAPLE
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
MATHEMATICA
nrows = 42;
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 = A077321[nmax = nrows (nrows + 1)/2];
a[n_] := T[[n (n + 1)/2]];
Table[a[n], {n, 1, nrows}] (* Jean-François Alcover, May 30 2023, after R. J. Mathar *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Nov 04 2002
EXTENSIONS
Corrected and extended by R. J. Mathar, Feb 03 2007
STATUS
approved