%I A095189
%S A095189 0,41,442249570307408382321638310780109588391,41,3,3,3,2,2,2,2,2,2,2,19,
%T A095189 189207115002721,181,17,167,16158634964154228180872122424567684345543663819,
               15601,
%U A095189 15085130035827878542455979623747888891433345604817588712723282399687865427853871,
               1460552582234841803
%N A095189 Smallest prime formed by the digit string after decimal point of n^(1/
               n), or 0 if no such prime exists.
%C A095189 Conjecture: a(n) is nonzero for all n>1. Generates surprisingly large 
               primes that are easily certified using Elliptic curve techniques 
               (Mathematica's NumberTheory`PrimeQ`). For n=24 no certifiable prime 
               was found with fewer than 1024 digits. - Wouter Meeussen (wouter.meeussen(AT)pandora.be), 
               Jun 04 2004
%e A095189 a(7) = 3 as 7^(1/7) =1.3204692477561... and the least prime is 3.
%t A095189 << NumberTheory`PrimeQ`; Table[{n, k = 1; While[temp = Floor[10^k FractionalPart[n^(1/
               n)]]; k < 256 && (temp === 1 || ! ProvablePrimeQ[temp]), k++ ]; temp, 
               k}, {n, 2, 23}]
%Y A095189 Cf. A095188.
%Y A095189 Sequence in context: A114927 A087512 A125194 this_sequence A023932 A022074 
               A037938
%Y A095189 Adjacent sequences: A095186 A095187 A095188 this_sequence A095190 A095191 
               A095192
%K A095189 base,nonn
%O A095189 1,2
%A A095189 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 02 2004
%E A095189 Corrected and extended by Wouter Meeussen (wouter.meeussen(AT)pandora.be), 
               Jun 04 2004