Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113575
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113575 Least (2n-1)-digit palindromic prime == 1 (mod n), or 0 if no such prime exists. +0
2
2, 101, 10501, 1003001, 100030001, 10000500001, 1000024200001, 100000323000001, 10000005750000001, 1000000008000000001, 100000005484500000001, 10000000004640000000001, 1000000001102011000000001, 100000000000131000000000001, 10000000000003830000000000001 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.