Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056732
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056732 Smallest palindromic prime using n distinct n digits, or 0 if no such number exists. +0
2
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; listen)
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: A003579 A099169 A143135 this_sequence A157715 A001271 A038371

Adjacent sequences: A056729 A056730 A056731 this_sequence A056733 A056734 A056735

KEYWORD

nonn,base

AUTHOR

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

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research