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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090742 a(n) = largest prime such that any n consecutive digits gives a distinct prime. 0

%I #15 Nov 01 2022 07:15:09

%S 7523,619737131179,9419919379719113739773313173,

%T 9551979199733313739311933719319133,

%U 763031379939791939113997931991393133317939371999719,9651473911777911173191173713117119,99071479791317917331771937311,6195066779711393117319331177319

%N a(n) = largest prime such that any n consecutive digits gives a distinct prime.

%H J. R. Rickard and J. J. Hitchcock, <a href="https://archim.org.uk/eureka/archive/Eureka-40.pdf">Problems Drive</a>, Eureka, 40 (1979), p. 29 (problem nr. 10), p. 40 (solution).

%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_253.htm">Puzzle 253: "Eureka?"</a>, The Prime Puzzles & Problems Connection.

%e In 619737131179 the strings 61, 19, 97, ..., 79 form distinct primes. No larger prime has this property, so a(2) = 619737131179.

%K nonn,base

%O 1,1

%A _Ray G. Opao_, Feb 03 2004

%E a(4) through a(8) found by J. K. Andersen.

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 1 14:09 EST 2023. Contains 367476 sequences. (Running on oeis4.)