A086766 a(n) = smallest r where (concatenation of n, r times with itself)*10 + 1 is a prime given by A087403(n), or 0 if no such number exists.
1, 3, 1, 1, 11, 1, 1, 2, 2, 1, 9, 3, 1, 5, 1, 3, 15, 1, 1, 2, 1, 60, 3, 1, 1, 2, 1, 1, 5, 5, 1, 2, 1, 6, 12, 3, 12, 3, 5, 1, 2, 1, 1, 5, 3, 1, 0, 2, 1, 9, 2, 1, 6, 1, 6, 18, 1, 3, 45, 1, 6, 3, 1, 1, 2, 1, 0, 3, 1, 1, 2, 3, 4, 8, 1, 1, 6, 2, 36, 96, 1, 1, 5, 304, 6, 2, 6, 1, 2, 2, 1, 2, 5, 1, 6, 5, 1, 2, 1, 0
Offset: 1
Examples
a(2) = 3, 2221 is a prime but 21 and 221 are composite.
Links
- Derek Orr, Values of a(n) > 1000 for n < 1000
Crossrefs
Cf. A087403.
Programs
-
PARI
a(n)=for(k=1,10^4,if(ispseudoprime((n/(10^#Str(n)-1))*(10^(#Str(n)*k+1)-10)+1),return(k))) vector(46,n,a(n)) \\ Derek Orr, Oct 02 2014
Extensions
More terms from Ray Chandler, Sep 23 2003
Comments