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”).

a(1) = 7; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
0

%I #3 Dec 05 2013 19:55:16

%S 7,71,271,2711,52711,5271107,95271107,9527110787,59527110787,

%T 5952711078773,65952711078773,6595271107877341,36595271107877341,

%U 3659527110787734161,33659527110787734161,3365952711078773416187

%N a(1) = 7; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).

%Y Cf. A069614 to A069621, A069628 to A069636.

%K nonn,base

%O 1,1

%A _Amarnath Murthy_, Mar 27 2002

%E Edited and extended by _Robert G. Wilson v_, Apr 03 2002