The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113576 Least (2n-1)-digit palindromic prime == 1 (mod 2n-1), or 0 if no such prime exists. 1


%S 2,151,10301,1008001,100161001,10002520001,1000605060001,

%T 100000323000001,10000007070000001,1000000310130000001,

%U 100000000212000000001,10000000001710000000001,1000000000016100000000001,100000000000656000000000001,10000000000004740000000000001

%N Least (2n-1)-digit palindromic prime == 1 (mod 2n-1), or 0 if no such prime exists.

%C Conjecture: No term is zero.

%e a(3) = 10301 == 1 mod 5.

%Y Cf. A113575.

%K base,easy,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 06 2005

%E More terms from _R. J. Mathar_, Aug 28 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 16:06 EST 2021. Contains 349565 sequences. (Running on oeis4.)