login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056732 Smallest palindromic prime using n distinct n digits, or 0 if no such number exists. 1
2, 11, 101, 0, 10301, 0, 1003001, 0, 100030001, 0, 10000500001, 0, 1000008000001, 0, 100000323000001, 0, 10000000500000001, 0, 1000000008000000001, 0, 100000000212000000001, 0, 10000000000300000000001, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

MATHEMATICA

Do[ k = 10^n; While[ ! PrimeQ[ k*10^n + FromDigits[ Take[ Reverse[ RealDigits[ k ][ [ 1 ] ] ], {2, -1} ] ] ], k++ ]; Print[ k*10^n + FromDigits[ Take[ Reverse[ RealDigits[ k ][ [ 1 ] ] ], {2, -1} ] ] ]; If[ n == 0, Print[ 11 ], Print[ 0 ] ], {n, 0, 12} ]

CROSSREFS

Sequence in context: A099169 A143135 A205806 * A157715 A001271 A038371

Adjacent sequences:  A056729 A056730 A056731 * A056733 A056734 A056735

KEYWORD

nonn,base

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 11 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.