Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071606
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071606 Smallest zero-free palindromic prime of 2n + 1 digits. +0
1
2, 131, 11311, 1114111, 111181111, 11112721111, 1111118111111, 111111151111111, 11111112521111111, 1111111111111111111, 111111111161111111111, 11111111111111111111111 (list; graph; listen)
OFFSET

0,1

MATHEMATICA

a[n_] := Block[{k = (10^(n + 1) - 1)/9}, While[m = FromDigits[ Join[ IntegerDigits[k], Reverse[ Drop[ IntegerDigits[k], -1]]]]; !PrimeQ[m], k++ ]; m]; Table[ a[n], {n, 0, 13}]

CROSSREFS

Cf. A028989.

Sequence in context: A125633 A089662 A119778 this_sequence A080282 A131931 A020524

Adjacent sequences: A071603 A071604 A071605 this_sequence A071607 A071608 A071609

KEYWORD

nonn,base

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 21 2002

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 21 2002

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research