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!)
A052080 Concatenation of n consecutive descending numbers starting from a(n) produces the smallest possible prime of this form, 0 if no such prime exists. 3
2, 4, 0, 10, 7, 0, 73, 46, 0, 56, 219, 0, 25, 60, 0, 52, 117, 0, 535, 172, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
First hard cases occur for n = 22, 88 and 110.
a(22) = 10^1631 + 10 was found by James G. Merickel in Feb 2011.
a(88) = 10^14 + 6.
a(110) = 10^19 + 26 was found by Chris Nash.
LINKS
C. Rivera, Prime Puzzle 78
EXAMPLE
For n = 8 we have a(8) = 46 so the eight consecutive descending numbers 46,45,44,43,42,41,40 and 39 concatenated together gives the smallest possible prime of this form, 4645444342414039.
CROSSREFS
Sequence in context: A180192 A369019 A066529 * A261754 A073451 A078022
KEYWORD
nonn,base,hard
AUTHOR
Patrick De Geest, Jan 15 2000
EXTENSIONS
Terms a(7)-a(21) calculated by Carlos Rivera and Felice Russo
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 08:14 EDT 2024. Contains 371769 sequences. (Running on oeis4.)