cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A176119 Smallest prime p = p(n) beginning with exactly n strings "13". (n = 1, 2, ...).

Original entry on oeis.org

13, 131303, 13131317, 131313137, 13131313133, 13131313131329, 131313131313139, 1313131313131313083, 13131313131313131331, 1313131313131313131333, 131313131313131313131363
Offset: 1

Views

Author

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

Keywords

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

Examples

			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

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

Original entry on oeis.org

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

Views

Author

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

Keywords

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

Showing 1-2 of 2 results.