The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073034 Take A000040, omit commas: 23571113171923..., select 1-digit primes. 3
 2, 3, 5, 7, 3, 7, 2, 3, 2, 3, 3, 7, 3, 7, 5, 3, 5, 7, 7, 7, 3, 7, 3, 7, 3, 7, 3, 2, 7, 3, 3, 7, 3, 5, 5, 7, 3, 7, 7, 3, 7, 3, 7, 2, 2, 2, 3, 2, 2, 7, 2, 2, 2, 3, 3, 2, 3, 2, 2, 5, 2, 5, 7, 2, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE In the sequence 2357111317192329... (primes without delimiters) one-digit primes are 2,3,5,7,3,7,2,3,2... MATHEMATICA p200=Flatten[IntegerDigits[Prime[Range[200]]]]; n=4; (* n-digit primes!*) pn=Partition[p200, n, 1]; ln=Length[pn]; tab=Table[Sum[10^(n-k)*pn[[i, k]], {k, n}], {i, ln}]; Select[tab, PrimeQ] PROG (Haskell) a073034 n = a073034_list !! (n-1) a073034_list = filter (`elem` [2, 3, 5, 7]) a033308_list -- Reinhard Zumkeller, Mar 11 2014 CROSSREFS Cf. A010051, A033308. Sequence in context: A039706 A156208 A239695 * A239037 A126050 A163821 Adjacent sequences: A073031 A073032 A073033 * A073035 A073036 A073037 KEYWORD easy,nonn,base AUTHOR Zak Seidov, Aug 22 2002 STATUS approved

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.

Last modified December 5 20:47 EST 2022. Contains 358593 sequences. (Running on oeis4.)