login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176119 Smallest prime p = p(n) beginning with exactly n strings "13". (n = 1, 2, ...). 1

%I #1 Jun 01 2010 03:00:00

%S 13,131303,13131317,131313137,13131313133,13131313131329,

%T 131313131313139,1313131313131313083,13131313131313131331,

%U 1313131313131313131333,131313131313131313131363

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

%C See references of A176096

%C List of appendices:

%C 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

%e n = 1: prime(6) = 13 is 1st term of sequence

%e n = 2: prime(12268) = 131303 is 2nd term of sequence

%e n = 12: p(12) is first such palindromic prime (i.e. appendix 1)

%e Curious: (13)_18//139 = p(18) = p(19) = (13)_19//9

%Y A065585, A176096

%K base,nonn

%O 1,1

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)