# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a275467
Showing 1-1 of 1

%I A275467 #34 Sep 26 2016 22:09:14
%S A275467 11,13,17,19,31,23,37,29,41,43,47,59,61,53,67,79,71,73,97,89,101,83,
%T A275467 107,109,131,103,127,139,151,113,137,149,181,163,157,179,191,173,167,
%U A275467 199,211,193,197,229,241,223,227,239,251,233,257,269
%N A275467 Array read by rows with four columns T(n,k) in which row n lists the primes > 10 ending in 1, 3, 7, 9 respectively and not yet present in the sequence.
%H A275467 Charles R Greathouse IV, <a href="/A275467/b275467.txt">Table of n, a(n) for n = 1..10000</a>
%H A275467 A. Granville and G. Martin, <a href="http://www.jstor.org/stable/27641834">Prime number races</a>, Amer. Math. Monthly, 113 (No. 1, 2006), 1-33.
%H A275467 J. Kaczorowski, <a href="http://dx.doi.org/10.1006/jnth.1995.1006">On the Shanks-Rényi Race Problem mod 5</a>,  J. Number Theory 50 (1995), 106-118.
%F A275467 From _Charles R Greathouse IV_, Jul 29 2016: (Start)
%F A275467 For n > 4, a(n) is the smallest prime greater than a(n-4) and congruent to a(n-4) mod 10.
%F A275467 a(n) ~ n log n. (End)
%F A275467 From _Omar E. Pol_, Jul 29 2016: (Start)
%F A275467 T(n,1) = A030430(n).
%F A275467 T(n,2) = A030431(n+1).
%F A275467 T(n,3) = A030432(n+1).
%F A275467 T(n,4) = A030433(n).
%F A275467 (End)
%e A275467 From _Omar E. Pol_, Jul 29 2016: (Start)
%e A275467 Array begins:
%e A275467 11,   13,  17,  19;
%e A275467 31,   23,  37,  29;
%e A275467 41,   43,  47,  59;
%e A275467 61,   53,  67,  79;
%e A275467 71,   73,  97,  89;
%e A275467 101,  83, 107, 109;
%e A275467 131, 103, 127, 139;
%e A275467 151, 113, 137, 149;
%e A275467 181, 163, 157, 179;
%e A275467 ... (End)
%p A275467 N:= 100: # to get the first 4*N terms
%p A275467 A:= Vector(4*N);
%p A275467 for j from 1 to 4 do
%p A275467   m:= 0;
%p A275467   for k from 1 while m < N do
%p A275467     if isprime(10*k+[1,3,7,9][j]) then
%p A275467       m:= m+1; A[(m-1)*4+j]:= 10*k+[1,3,7,9][j];
%p A275467     fi
%p A275467   od
%p A275467 od:
%p A275467 convert(A,list); # _Robert Israel_, Sep 02 2016
%o A275467 (PARI) {
%o A275467 n1=10;n3=12;n7=16;n9=18;
%o A275467 for(i=1,20,
%o A275467      while(n1%10<>1,n1=nextprime(n1+1));print1(n1", ");
%o A275467      while(n3%10<>3,n3=nextprime(n3+1));print1(n3", ");
%o A275467      while(n7%10<>7,n7=nextprime(n7+1));print1(n7", ");
%o A275467      while(n9%10<>9,n9=nextprime(n9+1));print1(n9", ");
%o A275467      n1++;n3++;n7++;n9++;
%o A275467    )
%o A275467 }
%o A275467 (PARI) my(v=[1,3,7,9]); for(i=1,20, for(j=1,4, while(!isprime(v[j]+=10),); print1(v[j]", "))) \\ _Charles R Greathouse IV_, Jul 29 2016
%Y A275467 Cf. A030430, A030431, A030432, A030433.
%K A275467 nonn,base,tabf
%O A275467 1,1
%A A275467 _Dimitris Valianatos_, Jul 28 2016
%E A275467 Better definition from _Omar E. Pol_, Jul 29 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE