|
Search: id:A082770
|
|
|
| A082770 |
|
a(n) = smallest palindromic prime that begins with A082768(n) and contains more than twice the number of digits in A082768(n), or 0 if no such number exists. |
|
+0
3
|
|
| 101, 313, 727, 919, 10301, 11311, 12421, 13331, 14341, 15451, 16061, 17471, 18181, 19391, 30103, 31013, 32323, 33533, 34543, 35053, 36263, 37273, 38083, 39293, 70207, 71317, 72227, 73037, 74047, 75557, 76367, 77377, 78487, 79397, 90709
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture: no entry is zero. In most cases the number of digits required is 2k+1 where k is the number of digits in A082768(n). What is the first entry that requires more (than 2k+1) digits?
Answer to question: A082768(37) = 92, a(37) = 9200029. - David Wasserman (wasserma(AT)spawar.navy.mil), Jul 28 2005
|
|
CROSSREFS
|
Cf. A082768, A082769.
Adjacent sequences: A082767 A082768 A082769 this_sequence A082771 A082772 A082773
Sequence in context: A139701 A142578 A134971 this_sequence A142769 A142264 A142136
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 18 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 28 2005
|
|
|
Search completed in 0.002 seconds
|
