Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113576
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113576 Least (2n-1)-digit palindromic prime == 1 (mod 2n-1), or 0 if no such prime exists. +0
2
2, 151, 10301, 1008001, 100161001, 10002520001, 1000605060001, 100000323000001, 10000007070000001, 1000000310130000001, 100000000212000000001, 10000000001710000000001, 1000000000016100000000001, 100000000000656000000000001, 10000000000004740000000000001 (list; graph; listen)
OFFSET

1,1

COMMENT

Conjecture: No term is zero.

EXAMPLE

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

CROSSREFS

Cf. A113575.

Adjacent sequences: A113573 A113574 A113575 this_sequence A113577 A113578 A113579

Sequence in context: A128350 A046473 A024245 this_sequence A102458 A064436 A012605

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 06 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 28 2007

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research