id:A101462 - OEIS Search Results

Search: id:A101462

Displaying 1-1 of 1 results found.

page 1

Smallest k such that 2^k-prime(n) is prime.

+0
1

2, 3, 3, 39, 4, 4, 6, 5, 6, 5, 7, 11, 6, 29, 6, 6, 6, 6, 7, 10, 9, 9, 8, 8, 7, 26, 9, 8, 7, 10, 47, 14, 10, 9, 12, 31, 15, 9, 8, 8, 12, 9, 14, 21, 10, 9, 25, 261, 8, 9, 8, 8, 9, 8, 14, 10, 16, 9, 15, 10, 9, 12, 11, 14, 9, 12, 9, 791, 10, 9, 16, 20, 15, 9, 11, 10, 16, 15, 26, 9, 12, 11, 10 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Conjecture: sequence is defined for all n. First unproved n: 286 Prime(286)=1871, up to date, tested up to k=40959, none 2^k-Prime(286) is prime.` `Primo was used for testing large primes.`
	LINKS	`Lei Zhou, Between 2^n and primes.`
	EXAMPLE	`Prime(1)=2, 2^2-2 = 2 is prime` `Prime(2)=3, 2^3-3 = 5 is prime` `...` `Prime(68)=337, 2^791-337 is prime.`
	CROSSREFS	`Cf. A094076.` `Adjacent sequences: A101459 A101460 A101461 this_sequence A101463 A101464 A101465` `Sequence in context: A084956 A100650 A096502 this_sequence A088266 A116889 A037847`
	KEYWORD	`nonn`
	AUTHOR	`Lei Zhou (lzhou5(AT)emory.edu), Jan 20 2005`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research