This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052077 Smallest prime formed by concatenating n consecutive increasing numbers, or 0 if no such prime exists. 7
 2, 23, 0, 4567, 1516171819, 0, 78910111213, 23456789, 0, 45678910111213, 129130131132133134135136137138139, 0, 567891011121314151617, 5051525354555657585960616263, 0, 128129130131132133134135136137138139140141142143 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Starting numbers in concatenations are given by A052079. LINKS Paolo P. Lava, Table of n, a(n) for n = 1..43 C. Rivera, Prime Puzzle 78 MATHEMATICA f[n_] := If[Mod[n, 3] == 0, 0, Block[{k = 1}, While[d = FromDigits@ Flatten@ IntegerDigits[ Range[k, k + n - 1]]; !PrimeQ@ d, k++]; d]]; Array[f, 16] (* Robert G. Wilson v, Jun 29 2012 *) CROSSREFS Cf. A052078, A052079, A052080, A030997. Sequence in context: A060601 A053952 A261198 * A124604 A323396 A107801 Adjacent sequences:  A052074 A052075 A052076 * A052078 A052079 A052080 KEYWORD nonn,base,nice AUTHOR Patrick De Geest, Jan 15 2000 EXTENSIONS Terms a(7)-a(15) are calculated by Carlos Rivera and Felice Russo a(16) from Max Alekseyev, Jan 31 2010 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 September 15 14:53 EDT 2019. Contains 327078 sequences. (Running on oeis4.)