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 A138905 #11 Jun 23 2025 22:19:12
%S A138905 5,23,71,167,179,431,461,863,863,839,1583,1511,1949,2099,2339,4127,
%T A138905 4283,4751,4673,4919,5669,6599,8693,10079,7349,10607,12149,11087,
%U A138905 12527,11159,15809,19583,16829,19583,13859,25703,24197,25307,23633,21839,34439
%N A138905 a(n) is n-th prime == -1 (mod 6n).
%H A138905 David Radcliffe, <a href="/A138905/b138905.txt">Table of n, a(n) for n = 1..10000</a>
%e A138905 a(1) = 1st term in A007528 (Primes of form 6n-1)
%e A138905 a(2) = 2nd term in A068231 (Primes congruent to 11 (mod 12))
%e A138905 a(3) = 3rd term in A061242 (Primes of form 18n-1)
%e A138905 a(4) = 4th term in A134517 (Primes of form 24n-1)
%e A138905 a(5) = 5th term in A132236 (Primes congruent to 29 (mod 30))
%t A138905 a[n_]:=Module[{p=1,cnt=0},Until[cnt==n,If[Mod[Prime[p],6n]==6n-1,cnt++];p++];Prime[p-1]];Array[a,41] (* _James C. McMahon_, Jun 22 2025 *)
%Y A138905 Cf. A007528, A061242, A068231, A093871, A132236, A134517, A138906, A138907.
%K A138905 nonn
%O A138905 1,1
%A A138905 _Zak Seidov_, Apr 03 2008