cp's OEIS Frontend

A089779 Let n range through the odd numbers skipping multiples of 5; a(n) = n-th prime ending in n.

%I A089779 #12 Dec 11 2017 02:46:14
%S A089779 11,23,107,179,2411,3413,5417,4919,6121,5923,9127,8629,9931,10133,
%T A089779 10937,11939,14741,14243,16747,16649,16451,18553,19157,19259,22961,
%U A089779 22963,24767,25169,28571,24373,28277,31079,30181,29483,31687,33589,33091
%N A089779 Let n range through the odd numbers skipping multiples of 5; a(n) = n-th prime ending in n.
%H A089779 Robert Israel, <a href="/A089779/b089779.txt">Table of n, a(n) for n = 1..10000</a>
%e A089779 2411 is the 11th prime ending in 11: (11, 211, ..., 2111, 2311, 2411)
%p A089779 f:= proc(n) local d,k,count;
%p A089779 d:= 10^(ilog10(n)+1);
%p A089779 count:= 0;
%p A089779 for k from 0 while count < n do
%p A089779    if isprime(k*d+n) then count:= count+1 fi
%p A089779 od;
%p A089779 (k-1)*d+n
%p A089779 end proc:
%p A089779 seq(seq(f(10*i+j),j=[1,3,7,9]),i=0..10); # _Robert Israel_, Dec 10 2017
%t A089779 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; f[n_] := Block[{p = 2, c = 0, m = Floor[ Log[10, n] + 1]}, While[ If[ Mod[p, 10^m] == n, c++ ]; c < n, p = NextPrim[p]]; p]; Map[f, Select[ Table[n, {n, 1, 91, 2}], Mod[ #, 10] != 5 &]] (* _Robert G. Wilson v_, Nov 26 2003 *)
%K A089779 base,nonn
%O A089779 1,1
%A A089779 _Amarnath Murthy_, Nov 24 2003
%E A089779 Extended by _Robert G. Wilson v_, Nov 26 2003