A331806 a(n) is the least prime p > n which is palindromic in base n.
3, 13, 5, 31, 7, 71, 73, 109, 11, 199, 13, 313, 197, 241, 17, 307, 19, 419, 401, 463, 23, 599, 577, 701, 677, 757, 29, 929, 31, 1117, 1153, 1123, 1259, 1471, 37, 1481, 1483, 1873, 41, 1723, 43, 1979, 2069, 2161, 47, 2351, 2593, 2549, 2551, 2857, 53, 2969, 2917, 3191, 3137
Offset: 2
Examples
a(2) = 3 which is 11 in binary, a(3) = 13 which is 111 in ternary, a(4) = 5 which is 11 in quaternary, a(16) = 17 which is 11 in hexadecimal. If we use the representation described earlier, then: a(2) = 3 is [1, 1]_2, a(3) = 13 is [1, 1, 1]_3, a(4) = 5 is [1, 1]_4, a(11) = 199 is [1, 7, 1]_11, a(13) = 313 is [1, 11, 1]_13, a(16) = 17 is [1, 1]_16, a(48) = 2593 is [1, 6, 1]_48.
Links
- Colin M Ready, Table of n, a(n) for n = 2..7000
Programs
-
Mathematica
Array[If[PrimeQ[# + 1], # + 1, Block[{p = If[PrimeQ@ #1, #1, Prime[#2 + 1]] & @@ {#, PrimePi[#]}}, While[! PalindromeQ@ IntegerDigits[p, #], Set[p, NextPrime@ p]]; p]] &, 55, 2] (* Michael De Vlieger, Jan 27 2020 *)
-
PARI
a(n) = {forprime(p=n+1, oo, my(d=digits(p, n)); if (Vecrev(d) ==d, return(p)););} \\ Michel Marcus, Jan 27 2020
Formula
a(p-1) = p for prime p > 2.
a(n) <= A087952(n) with equality if n+1 is not prime. - M. F. Hasler, Feb 27 2020
Comments