login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A265774
Numerators of upper primes-only best approximates (POBAs) to sqrt(2); see Comments.
8
3, 19, 53, 61, 197, 211, 443, 491, 839, 1051, 1249, 1427, 3701, 17351, 22247, 53569, 61927, 128033
OFFSET
1,1
COMMENTS
Suppose that x > 0. A fraction p/q of primes is an upper primes-only best approximate, and we write "p/q is in U(x)", if p'/q < x < p/q < u/v for all primes u and v such that v < q, where p' is greatest prime < p in case p >= 3.
Let q(1) = 2 and let p(1) be the least prime >= x. The sequence U(x) follows inductively: for n >= 1, let q(n) is the least prime q such that x < p/q < p(n)/q(n) for some prime p. Let q(n+1) = q and let p(n+1) be the least prime p such that x < p/q < p(n)/q(n).
For a guide to POBAs, lower POBAs, and upper POBAs, see A265759.
EXAMPLE
The upper POBAs to sqrt(2) start with 3/2, 19/13, 53/37, 61/43, 197/139, 211/149. For example, if p and q are primes and q > 139, and p/q > sqrt(2), then 197/139 is closer to sqrt(2) than p/q is.
MATHEMATICA
x = Sqrt[2]; z = 200; p[k_] := p[k] = Prime[k];
t = Table[Max[Table[NextPrime[x*p[k], -1]/p[k], {k, 1, n}]], {n, 1, z}];
d = DeleteDuplicates[t]; tL = Select[d, # > 0 &] (* lower POBA *)
t = Table[Min[Table[NextPrime[x*p[k]]/p[k], {k, 1, n}]], {n, 1, z}];
d = DeleteDuplicates[t]; tU = Select[d, # > 0 &] (* upper POBA *)
v = Sort[Union[tL, tU], Abs[#1 - x] > Abs[#2 - x] &];
b = Denominator[v]; s = Select[Range[Length[b]], b[[#]] == Min[Drop[b, # - 1]] &];
y = Table[v[[s[[n]]]], {n, 1, Length[s]}] (* POBA, A265776/A265777 *)
Numerator[tL] (* A265772 *)
Denominator[tL] (* A265773 *)
Numerator[tU] (* A265774 *)
Denominator[tU] (* A265775 *)
Numerator[y] (* A265776 *)
Denominator[y] (* A265777 *)
KEYWORD
nonn,frac,more
AUTHOR
Clark Kimberling, Dec 20 2015
EXTENSIONS
a(14)-a(18) from Robert Price, Apr 05 2019
STATUS
approved