cp's OEIS Frontend

A176833 Smallest prime p = prime(i) such that concatenation q(i) = 13//0_(k)//prime(i) (k = 0, 1, 2, ...) is prime.

%I A176833 #2 Apr 17 2016 08:56:55
%S A176833 7,3,3,3,151,61,7,3,19,3,109,109,19,19,37,409,109,97,61,19,73,109,139,
%T A176833 139,619,31,127,31,193,3,43,19,337,7,73,367,109,373,139,139
%N A176833 Smallest prime p = prime(i) such that concatenation q(i) = 13//0_(k)//prime(i) (k = 0, 1, 2, ...) is prime.
%C A176833 See comments in A176781
%C A176833 Necessarily p = 3 or p of form 3 * n + 1
%C A176833 In recreational mathematics some authors call a prime that is composed of mostly naughts, i.e. zeros, a naughty prime
%e A176833 q(0) = 13//7 = 137 = prime(33), 7 = prime(4) is 1st term
%e A176833 q(1) = 13//0//3 = 1303 = prime(213), 3 = prime(2) is 2nd term
%e A176833 q(26) = 13000000000000000000000000031 is a palindromic prime
%Y A176833 A164968, A173291, A176316, A176781
%K A176833 base,nonn
%O A176833 1,1
%A A176833 Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Apr 27 2010