id:A135584 - OEIS Search Results

Search: id:A135584

Displaying 1-1 of 1 results found.

page 1

For any n>=1 the sequence gives the minimum prime p such that 10^n-p is also a prime.

+0
1

3, 3, 3, 59, 11, 17, 29, 11, 71, 71, 23, 11, 29, 29, 11, 83, 3, 11, 281, 11, 101, 71, 23, 257, 401, 293, 107, 293, 53, 11, 113, 251, 47, 587, 23, 179, 389, 59, 173, 17, 1427, 83, 431, 53, 563, 593, 41, 47, 239, 383, 431, 1181, 701, 971, 149, 593, 569, 149, 191, 1973 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`n=1 -> 10^1-2=8 (not prime) -> 10^1-3=7 (prime) -> 3 n=2 -> 10^2-2=98 (not prime) -> 10^2-3=97 (prime) -> 3`
	MAPLE	`P:=proc(n) local a, i, k; for i from 0 by 1 to n do k:=1; while ithprime(k)<10^i do a:=10^i-ithprime(k); if isprime(a) then print(ithprime(k)); break; fi; k:=k+1; od; od; end: P(1000);`
	CROSSREFS	`Sequence in context: A033874 A122092 A025549 this_sequence A091323 A118539 A015665` `Adjacent sequences: A135581 A135582 A135583 this_sequence A135585 A135586 A135587`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Feb 25 2008`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research