%I #16 Feb 25 2022 10:30:35
%S 11,3,7,19,11,13,17,19,31,233,37,139,71,73,277,79,191,193,97,199,2111,
%T 113,1117,3119,131,4133,137,139,1171,173,4177,179,191,193,197,199,311,
%U 313,317,1319,331,2333,337,2339,2371,373,2377,379,3391,2393,397,1399
%N Smallest prime having in decimal representation A136333(n) as suffix.
%C a(n) = A136333(n) iff A136333(n) itself is a prime number, cf. A091633.
%H Reinhard Zumkeller, <a href="/A245193/b245193.txt">Table of n, a(n) for n = 1..1000</a>
%e . n | a(n) | A136333(n)
%e . ------+---------+-----------
%e . 10 | 233 | 33
%e . 11 | 37 | 37
%e . 12 | 139 | 39
%e . 13 | 71 | 71
%e . 14 | 73 | 73
%e . 15 | 277 | 77
%e . 16 | 79 | 79
%e . 17 | 191 | 91
%e . 18 | 193 | 93
%e . 19 | 97 | 97
%e . 20 | 199 | 99
%e . 21 | 2111 | 111
%e . 22 | 113 | 113
%e . 23 | 1117 | 117
%e . 24 | 3119 | 119
%e . 25 | 131 | 131
%e . 26 | 4133 | 133
%e . 27 | 137 | 137
%e . 28 | 139 | 139
%e . 29 | 1171 | 171
%e . 30 | 173 | 173 .
%o (Haskell)
%o import Data.List (isSuffixOf); import Data.Function (on)
%o a245193 n = head [p | p <- a000040_list,
%o (isSuffixOf `on` show) (a136333 n) p]
%o (PARI) isok(m) = my(d=digits(m)); apply(x->gcd(x, 10), d) == vector(#d, k, 1); \\ A136333
%o f(m) = my(p=nextprime(m), s=10^#Str(m)); while ((p-m) % s, p = nextprime(p+1)); p;
%o lista(nn) = apply(x->f(x), select(isok, [1..nn]));
%o lista(1000) \\ _Michel Marcus_, Feb 25 2022
%Y Cf. A000040, A091633, A136333.
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Jul 18 2014
|