This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211396 Smallest prime substring of n, or 0 if no such substring exists. 2
 0, 0, 2, 3, 0, 5, 0, 7, 0, 0, 0, 11, 2, 3, 0, 5, 0, 7, 0, 19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 0, 41, 2, 3, 0, 5, 0, 7, 0, 0, 5, 5, 2, 3, 5, 5, 5, 5, 5, 5, 0, 61, 2, 3, 0, 5, 0, 7, 0, 0, 7, 7, 2, 3, 7, 5, 7, 7, 7, 7, 0, 0, 2, 3, 0, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) <= A047814(n); a(n) = 0 iff A039997(n) = 0, cf. A062115; a(n) = n iff n is prime and A039997(n) = 1. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) import Data.List (isInfixOf) a211396 n = if null ips then 0 else head ips    where ips = [p | p <- takeWhile (<= n) a000040_list,                     show p `isInfixOf` show n] CROSSREFS Sequence in context: A269668 A061397 A093438 * A047814 A101991 A296065 Adjacent sequences:  A211393 A211394 A211395 * A211397 A211398 A211399 KEYWORD nonn,base,look AUTHOR Reinhard Zumkeller, Feb 08 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 17:09 EST 2019. Contains 329970 sequences. (Running on oeis4.)