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!)
A069630 a(1) = 3; 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 #4 Dec 05 2013 19:55:16

%S 3,31,131,1319,21319,213193,12213193,122131939,1122131939,

%T 112213193909,17112213193909,171122131939093,18171122131939093,

%U 1817112213193909339,61817112213193909339,618171122131939093397,60618171122131939093397

%N a(1) = 3; 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. Different from A069615.

%K nonn,base

%O 1,1

%A _Amarnath Murthy_, Mar 27 2002

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

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)