[go: up one dir, main page]

login
Revision History for A344937 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) is the largest k such that when strings of zeros of lengths t = 1..k are inserted between every pair of adjacent digits of prime(n), the resulting numbers are all primes.
(history; published version)
#21 by Bruno Berselli at Tue Sep 07 04:13:13 EDT 2021
STATUS

reviewed

approved

#20 by Michel Marcus at Tue Sep 07 02:14:58 EDT 2021
STATUS

proposed

reviewed

#19 by Jon E. Schoenfield at Tue Sep 07 01:57:28 EDT 2021
STATUS

editing

proposed

#18 by Jon E. Schoenfield at Tue Sep 07 01:57:23 EDT 2021
EXAMPLE

For n = 8: prime(8) = 19 and the numbers 109, 1009 and 10009 are all prime, while 100009 is not. Thus it is possible to insert strings of zeros of lenghts lengths 1, 2 and 3 between all adjacent digits of 19 such that the resulting number is prime. Since 3 is the largest length of such a string in case of 19, a(8) = 3.

STATUS

approved

editing

#17 by Susanna Cuyler at Sun Jun 06 09:06:17 EDT 2021
STATUS

reviewed

approved

#16 by Michel Marcus at Sun Jun 06 05:42:30 EDT 2021
STATUS

proposed

reviewed

#15 by Jianing Song at Sun Jun 06 05:39:31 EDT 2021
STATUS

editing

proposed

#14 by Jianing Song at Sun Jun 06 05:39:20 EDT 2021
NAME

a(n) is the largest k such that when strings of zeros of lengths t = 1..k are inserted between every pair of adjacent digits of prime(n) , the resulting numbers are all primes.

STATUS

approved

editing

#13 by N. J. A. Sloane at Sat Jun 05 17:15:06 EDT 2021
STATUS

editing

approved

#12 by N. J. A. Sloane at Sat Jun 05 17:14:34 EDT 2021
NAME

a(n) is the largest k such that when inserting strings of zeros of lengths t = 1..k are inserted between all every pair of adjacent digits of prime(n), then each the resulting number is primenumbers are all primes.

STATUS

proposed

editing

Discussion
Sat Jun 05
17:15
N. J. A. Sloane: Edited definition.  Please note what I did.