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!)
A169798 a(n) = smallest prime number > a(n-1) that contains the n-th composite number as a substring. 6

%I #10 Jan 24 2023 10:08:16

%S 41,61,83,89,101,127,149,151,163,181,1201,1213,1223,1249,1259,2267,

%T 2273,2281,2309,3203,3301,3343,3359,3361,3389,3391,3407,4201,4409,

%U 4451,4463,4481,4493,4507,4513,4523,4547,5501,5563,5573,5581,6007,6203,6263,6421

%N a(n) = smallest prime number > a(n-1) that contains the n-th composite number as a substring.

%H Zak Seidov, <a href="/A169798/b169798.txt">Table of n,a(n) for n=1..1000</a>

%Y Cf. A144565.

%Y Cf. A177981, A177982. [From _Reinhard Zumkeller_, May 16 2010]

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, May 15 2010

%E Corrected and extended by _Zak Seidov_ and _D. S. McNeil_, May 16 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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)