login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A176119
Smallest prime p = p(n) beginning with exactly n strings "13". (n = 1, 2, ...).
1
13, 131303, 13131317, 131313137, 13131313133, 13131313131329, 131313131313139, 1313131313131313083, 13131313131313131331, 1313131313131313131333, 131313131313131313131363
OFFSET
1,1
COMMENTS
See references of A176096
List of appendices:
for 1st term p(1) = 13: ./., 03, 17, 7, 3, 29, 9, 083, 31, 33, 63, 1, 01, 09, 19, 31, 71, 139, 9, 107, 149
EXAMPLE
n = 1: prime(6) = 13 is 1st term of sequence
n = 2: prime(12268) = 131303 is 2nd term of sequence
n = 12: p(12) is first such palindromic prime (i.e. appendix 1)
Curious: (13)_18//139 = p(18) = p(19) = (13)_19//9
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Apr 09 2010
STATUS
approved