The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109926 Least k such that k-2^r is prime for n values of r. Index of the first occurrence of n in A109925. 1

%I

%S 1,3,4,15,21,45,75,465,1095,2145,4935,14955,80685,229845,1295325,

%T 1575285,9700575,20435415,15054105,53999715,2282745465

%N Least k such that k-2^r is prime for n values of r. Index of the first occurrence of n in A109925.

%C It appears that 3 and 5 divide a(n) for n>4. Note that a(18)<a(17). - _T. D. Noe_, Jul 19 2005

%C Conjecture: a(n)==0 (mod 3) for n > 2. Then n-2^k is not == 0 (mod 3) and a prime is more probable. - _Robert G. Wilson v_, Jul 21 2005

%C Conjecture: a(n+15)==0 (mod 30) for n > 4. - _Robert G. Wilson v_, Jul 21 2005

%C a(n) > 10^10 for n >= 21. - _Donovan Johnson_, Jan 21 2009

%e a(4) = 21, 21-2 =19, 21-4 = 17, 21-8 = 13, 21-16 = 5, 21 is the smallest number that gives four such primes.

%t t=Table[cnt=0; r=1; While[r<n, If[PrimeQ[n-r], cnt++ ]; r=2r]; cnt, {n, 250000}]; Table[First[Flatten[Position[t, n]]], {n, 13}] (Noe)

%t f[n_] := Count[ PrimeQ[n - 2^Range[0, Floor[ Log[2, n]]]], True]; t = Table[0, {30}]; Do[ a = f[n]; If[ t[[a+1]] == 0, t[[a+1]] = n], {n, 4*10^8}]; t (* _Robert G. Wilson v_ *)

%Y Cf. A109925.

%K hard,more,nonn

%O 0,2

%A _Amarnath Murthy_, Jul 17 2005

%E Edited, corrected and extended by _T. D. Noe_ and _Robert G. Wilson v_, Jul 19 2005

%E a(20) from _Donovan Johnson_, Jan 21 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 14:24 EDT 2021. Contains 345417 sequences. (Running on oeis4.)