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

%I #9 Dec 15 2020 09:10:11

%S 12,30,35,57,110,130,170,190,230,290,310,370,410,430,447,453,459,561,

%T 567,671,730,779,783,789,897,1010,1030,1070,1090,1113,1127,1131,1137,

%U 1139,1149,1510,1570,1630,1670,1730,1790,1810,1910,1930,1970,1990,2110

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

%F a(n) <= 10*n. [_Reinhard Zumkeller_, May 16 2010]

%e S = 12,30,35,57,110,130,170,190,230,290,310,370,410,430,447,...

%e p = .2.3...5..7.11..13..17..19..23..29..31..37..41..43...47...

%Y Cf. A169798.

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

%K nonn,base

%O 1,1

%A _Eric Angelini_, May 01 2010

%E Typo in example corrected by _D. S. McNeil_, May 16 2010

%E Corrected and extended by _D. S. McNeil_ and _Reinhard Zumkeller_, 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 19 04:12 EDT 2024. Contains 371782 sequences. (Running on oeis4.)