|
Search: id:A077713
|
|
|
| A077713 |
|
a(1) = 3, a(n) = the smallest prime such that deleting the most significant digit gives a(n-1). If no such number exists then the smallest prime so that a(n-1) is obtained by deleting the two most significant digits. (In general by deleting as many minimum number of (most significant) digits required). |
|
+0
4
|
|
| 3, 13, 113, 2113, 12113, 612113, 50612113, 1050612113, 6001050612113, 26001050612113, 1026001050612113, 6000001026001050612113, 500006000001026001050612113, 600500006000001026001050612113
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n) is obtained by prefixing a(n-1) with a number of the form d*10^k where d is a single digit. 0< d < 10. Conjecture: There exists a number k however large for every term. i.e. Only one digit (MSD) need be deleted.
|
|
EXAMPLE
|
a(7) = 50612113 deleting 5 gives 612113 = a(6).
|
|
CROSSREFS
|
Cf. A053583, A077714, A077715, A077716.
Sequence in context: A105431 A062447 A053583 this_sequence A119723 A093011 A057865
Adjacent sequences: A077710 A077711 A077712 this_sequence A077714 A077715 A077716
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 19 2002
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 23 2003
|
|
|
Search completed in 0.002 seconds
|
