OFFSET
1,1
COMMENTS
k is not congruent to 1 (mod 2), 1 (mod 3), or 4 (mod 5). - Charles R Greathouse IV, Apr 16 2012
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
1213 is prime, therefore 12 is a term.
MAPLE
concat:=proc(a, b) local bb: bb:=nops(convert(b, base, 10)): 10^bb*a+b end proc: a:=proc(n) if isprime(concat(n, n+1))=true then n else end if end proc: seq(a(n), n=0..500); # Emeric Deutsch, Nov 23 2007
MATHEMATICA
Select[ Range[500], PrimeQ[ ToExpression[ StringJoin[ ToString[#], ToString[#+1]]]]&] (* Jean-François Alcover, Nov 18 2011 *)
Select[Range[500], PrimeQ[FromDigits[Join[IntegerDigits[#], IntegerDigits[ #+1]]]]&] (* Harvey P. Dale, Dec 23 2015 *)
Position[#[[1]]*10^IntegerLength[#[[2]]]+#[[2]]&/@Partition[Range[ 500], 2, 1], _?PrimeQ]//Flatten (* Harvey P. Dale, Jul 14 2019 *)
PROG
(Haskell)
a030457 n = a030457_list !! (n-1)
a030457_list = filter ((== 1) . a010051' . a001704) [1..]
-- Reinhard Zumkeller, Jun 27 2015, Apr 26 2011
(PARI) for(n=1, 10^5, if(isprime(eval(concat(Str(n), n+1))), print1(n, ", "))); /* Joerg Arndt, Apr 27 2011 */
(Magma) [n: n in [1..500] | IsPrime(Seqint(Intseq(n+1) cat Intseq(n)))]; // Vincenzo Librandi, Jul 23 2016
(Python)
from sympy import isprime
def ok(n): return isprime(int(str(n)+str(n+1)))
print([k for k in range(500) if ok(k)]) # Michael S. Branicky, Apr 19 2023
CROSSREFS
KEYWORD
nonn,base,nice
AUTHOR
STATUS
approved