The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089776 If n mod 10 is 1, 3, 7, or 9, then a(n) = least prime of the form 1 followed by n^r; else a(n) = least prime of the form n^r followed by a 1. In both cases r must be > 1 and a(n) = 0 if no such prime exists. 0

%I

%S 11,41,13,41,251,61,17,641,19,101,114641,0,113,75295361,151,40961,

%T 1289,181,1361,4001,

%U 11025506433613486607375777617584133309366191904729927960524981845743709132117581,1368800680154120519681,1907846434775996175406740561329,241,251,6761,127,281,1500246412961,9001,131

%N If n mod 10 is 1, 3, 7, or 9, then a(n) = least prime of the form 1 followed by n^r; else a(n) = least prime of the form n^r followed by a 1. In both cases r must be > 1 and a(n) = 0 if no such prime exists.

%C Subsidiary sequence: 3 more sequences can be obtained by replacing 1 by 3,7 and 9.

%F If n is divisible by 2 or 5, a(n) = A088622(n); otherwise a(n) = A088623(n). - _David Wasserman_, Oct 12 2005

%e a(12) = 0 because 1+10*12^r is always divisible by 11.

%e a(32) = 0 because 1+10*32^r is divisible by 3 if r is odd and by 11 if r is even.

%Y Cf. A088622, A088623.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 24 2003

%E More terms from _David Wasserman_, Oct 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 31 19:40 EDT 2020. Contains 334748 sequences. (Running on oeis4.)