A176183 Smallest prime p = p(n) ending with exactly n strings "13".

13, 21313, 4131313, 1213131313, 81313131313, 1131313131313, 613131313131313, 21313131313131313, 8131313131313131313, 113131313131313131313, 171313131313131313131313, 23131313131313131313131313

Offset: 1

Author

Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Apr 11 2010

Keywords

• base
• nonn

Comments

See references of A176096.

List of prefixes: for 1st term p(1) = 13: ./., 2, 4, 12, 8, 1, 6, 2, 8, 1, 17, 23, 21, 8, 59, 87, 53, 46, 10, 8, 20, 73, 29, 20, 3, 2, 16, 33, 80, 2, ...

Examples

			n = 1: prime(6) = 13 is 1st term of sequence.
n = 2: prime(2392) = 21313 is 2nd term of sequence.
Note: 1st such palindromic prime (i.e. prefix 3): p(25) = 3(13)_25 = 313131313131313131313131313131313131313131313131313.
		

Crossrefs

Cf. A065580, A065585, A176096, A176119.