cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-8 of 8 results.

A265759 Numerators of primes-only best approximates (POBAs) to 1; see Comments.

Original entry on oeis.org

3, 2, 5, 13, 11, 19, 17, 31, 29, 43, 41, 61, 59, 73, 71, 103, 101, 109, 107, 139, 137, 151, 149, 181, 179, 193, 191, 199, 197, 229, 227, 241, 239, 271, 269, 283, 281, 313, 311, 349, 347, 421, 419, 433, 431, 463, 461, 523, 521, 571, 569, 601, 599, 619, 617
Offset: 1

Views

Author

Clark Kimberling, Dec 15 2015

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...).
See A265772 and A265774 for definitions of lower POBA and upper POBA. In the following guide, for example, A001359/A006512 represents (conjecturally in some cases) the Lower POBAs p(n)/q(n) to 1, where p = A001359 and q = A006512 except for first terms in some cases. Every POBA is either a lower POBA or an upper POBA.
x Lower POBA Upper POBA POBA
1 A001359/A006512 A006512/A001359 A265759/A265760
3/2 A104163/A158708 A162336/A158709 A265761/A222565
2 A005383/A005382 A005385/A005384 A079149/A120628
3 A091180/A088878 A094525/A023208 A265763/A265764
4 A162857/A062737 A090866/A023212 A265765/A120639
5 A265766/A158318 A265767/A023217 A265768/A265769
6 A227756/A158015 A051644/A007693 A265770/A265771
sqrt(2) A265772/A265773 A265774/A265775 A265776/A265777
sqrt(3) A265778/A265779 A265780/A265781 A265782/A265783
sqrt(5) A265784/A265785 A265786/A265787 A265788/A265789
sqrt(8) A265790/A265791 A265792/A265793 A265794/A265795
tau A265796/A265797 A265798/A265799 A265800/A265801
1/tau A265799/A265798 A265797/A265796 A265806/A265807
pi A265808/A265809 A265810/A265811 A265812/A265813
e A265814/A265815 A265816/A265817 A265818/A265819

Examples

			The POBAs for 1 start with 3/2, 2/3, 5/7, 13/11, 11/13, 19/17, 17/19, 31/29, 29/31, 43/41, 41/43, 61/59, 59/61. For example, if p and q are primes and q > 13, then 11/13 is closer to 1 than p/q is.

Crossrefs

Cf. A000040, A001359, A006512, A265759, A265760.

Programs

  • Mathematica
    x = 1; 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, A265759/A265760 *)
Numerator[tL]   (* A001359 *)
Denominator[tL] (* A006512 *)
Numerator[tU]   (* A006512 *)
Denominator[tU] (* A001359 *)
Numerator[y]    (* A265759 *)
Denominator[y]  (* A265760 *)

A265801 Denominators of primes-only best approximates (POBAs) to the golden ratio, tau; see Comments.

Original entry on oeis.org

2, 2, 3, 7, 19, 23, 29, 97, 353, 563, 631, 919, 1453, 2207, 15271, 15737, 42797, 49939
Offset: 1

Views

Author

Clark Kimberling, Jan 02 2016

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q, and also, |x - p/q| < |x - p'/q| for every prime p' except p. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...). See A265759 for a guide to related sequences.
Is this related to A165571? - R. J. Mathar, Jan 10 2016

Examples

			The POBAs to tau start with 5/2, 3/2, 5/3, 11/7, 31/19, 37/23, 47/29, 157/97, 571/353, 911/563. For example, if p and q are primes and q > 29, then 47/29 is closer to tau than p/q is.

Crossrefs

Cf. A000040, A265759, A265796, A265797, A265798, A265799, A265800.

Programs

  • Mathematica
    x = GoldenRatio; z = 1000; 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, A265800/A265801 *)
Numerator[tL]   (* A265796 *)
Denominator[tL] (* A265797 *)
Numerator[tU]   (* A265798 *)
Denominator[tU] (* A265799 *)
Numerator[y]    (* A265800 *)
Denominator[y]  (* A265801 *)

Extensions

a(15)-a(18) from Robert Price, Apr 06 2019

A265796 Numerators of lower primes-only best approximates (POBAs) to the golden ratio, tau (A001622); see Comments.

Original entry on oeis.org

3, 11, 37, 163, 173, 241, 571, 1231, 1571, 2351, 3571, 25463, 69247
Offset: 1

Views

Author

Clark Kimberling, Dec 29 2015

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a lower primes-only best approximate, and we write "p/q is in L(x)", if u/v < p/q < x < p'/q for all primes u and v such that v < q, where p' is least prime > p.
Let q(1) be the least prime q such that u/q < x for some prime u, and let p(1) be the greatest such u. The sequence L(x) follows inductively: for n > 1, let q(n) is the least prime q such that p(n)/q(n) < p/q < x for some prime p. Let q(n+1) = q and let p(n+1) be the greatest prime p such that p(n)/q(n) < p/q < x.
For a guide to POBAs, lower POBAs, and upper POBAs, see A265759.

Examples

			The lower POBAs to tau start with 3/2, 11/7, 37/23, 163/101, 173/107, 241/149. For example, if p and q are primes and q > 101, and p/q < tau, then 163/101 is closer to tau than p/q is.

Crossrefs

Cf. A000040, A001622, A265759, A265797, A265798, A265799, A265800, A265801.

Programs

  • Mathematica
    x = GoldenRatio; z = 1000; 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, A265800/A265801 *)
Numerator[tL]   (* A265796 *)
Denominator[tL] (* A265797 *)
Numerator[tU]   (* A265798 *)
Denominator[tU] (* A265799 *)
Numerator[y]    (* A265800 *)
Denominator[y]  (* A265801 *)

Extensions

a(12)-a(13) from Robert Price, Apr 06 2019

A265797 Denominator of lower primes-only best approximates (POBAs) to the golden ratio, tau (A001622); see Comments.

Original entry on oeis.org

2, 7, 23, 101, 107, 149, 353, 761, 971, 1453, 2207, 15737, 42797
Offset: 1

Views

Author

Clark Kimberling, Dec 29 2015

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a lower primes-only best approximate, and we write "p/q is in L(x)", if u/v < p/q < x < p'/q for all primes u and v such that v < q, where p' is least prime > p.
Let q(1) be the least prime q such that u/q < x for some prime u, and let p(1) be the greatest such u. The sequence L(x) follows inductively: for n > 1, let q(n) is the least prime q such that p(n)/q(n) < p/q < x for some prime p. Let q(n+1) = q and let p(n+1) be the greatest prime p such that p(n)/q(n) < p/q < x.
For a guide to POBAs, lower POBAs, and upper POBAs, see A265759.

Examples

			The lower POBAs to tau start with 3/2, 11/7, 37/23, 163/101, 173/107, 241/149. For example, if p and q are primes and q > 101, and p/q < tau, then 163/101 is closer to tau than p/q is.

Crossrefs

Cf. A000040, A001622, A265759, A265796, A265798, A265799, A265800, A265801.

Programs

  • Mathematica
    x = GoldenRatio; z = 1000; 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,A265800/A265801*)
Numerator[tL]   (*A265796*)
Denominator[tL] (*A265797*)
Numerator[tU]   (*A265798*)
Denominator[tU] (*A265799*)
Numerator[y]    (*A265800*)
Denominator[y]  (*A265801*)

Extensions

a(12)-a(13) from Robert Price, Apr 06 2019

A265798 Numerators of upper primes-only best approximates (POBAs) to the golden ratio, tau (A001622); see Comments.

Original entry on oeis.org

5, 5, 31, 47, 157, 911, 1021, 1487, 4283, 5147, 8629, 11069, 15017, 20939, 22447, 24709, 38239, 80803
Offset: 1

Views

Author

Clark Kimberling, Dec 29 2015

Keywords

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.

Examples

			The upper POBAs to tau start with 5/2, 5/3, 31/19, 47/29, 157/97, 911/563, 1021/631. For example, if p and q are primes and q > 97, and p/q > tau, then 157/97 is closer to tau than p/q is.

Crossrefs

Cf. A000040, A001622, A265759, A265796, A265797, A265799, A265800, A265801.

Programs

  • Mathematica
    x = GoldenRatio; z = 1000; 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, A265800/A265801 *)
Numerator[tL]   (* A265796 *)
Denominator[tL] (* A265797 *)
Numerator[tU]   (* A265798 *)
Denominator[tU] (* A265799 *)
Numerator[y]    (* A265800 *)
Denominator[y]  (* A265801 *)

Extensions

a(13)-a(18) from Robert Price, Apr 06 2019

A265800 Numerators of primes-only best approximates (POBAs) to the golden ratio, tau; see Comments.

Original entry on oeis.org

5, 3, 5, 11, 31, 37, 47, 157, 571, 911, 1021, 1487, 2351, 3571, 24709, 25463, 69247, 80803
Offset: 1

Views

Author

Clark Kimberling, Dec 29 2015

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q, and also, |x - p/q| < |x - p'/q| for every prime p' except p. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...). See A265759 for a guide to related sequences.
How is this related to A165572? - R. J. Mathar, Jan 10 2016

Examples

			The POBAs to tau start with 5/2, 3/2, 5/3, 11/7, 31/19, 37/23, 47/29, 157/97, 571/353, 911/563. For example, if p and q are primes and q > 29, then 47/29 is closer to tau than p/q is.

Crossrefs

Cf. A000040, A265759, A265796, A265797, A265798, A265799, A265801.

Programs

  • Mathematica
    x = GoldenRatio; z = 1000; 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, A265800/A265801 *)
Numerator[tL]   (* A265796 *)
Denominator[tL] (* A265797 *)
Numerator[tU]   (* A265798 *)
Denominator[tU] (* A265799 *)
Numerator[y]    (* A265800 *)
Denominator[y]  (* A265801 *)

Extensions

a(15)-a(18) from Robert Price, Apr 06 2019

A265806 Numerators of primes-only best approximates (POBAs) to 1/(golden ratio) = 1/tau; see Comments.

Original entry on oeis.org

2, 2, 3, 19, 23, 29, 97, 353, 563, 631, 919, 1453, 2207, 15271, 15737, 42797, 49939
Offset: 1

Views

Author

Clark Kimberling, Jan 02 2016

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q, and also, |x - p/q| < |x - p'/q| for every prime p' except p. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...). See A265759 for a guide to related sequences. Many terms of A265806 are also terms of A265801 (denominators of POBAs to tau).

Examples

			The POBAs to 1/tau start with 2/2, 2/3, 3/5, 19/31, 23/37, 29/47, 97/157, 353/571. For example, if p and q are primes and q > 157, then 97/157 is closer to 1/tau than p/q is.

Crossrefs

Cf. A000040, A265759, A265799, A265798, A265797, A265796, A265807.

Programs

  • Mathematica
    x = 1/GoldenRatio; z = 1000; 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, A265806/A265807 *)
Numerator[tL]   (* A265799 *)
Denominator[tL] (* A265798 *)
Numerator[tU]   (* A265797 *)
Denominator[tU] (* A265796 *)
Numerator[y]    (* A265806 *)
Denominator[y]  (* A265807 *)

Extensions

a(14)-a(17) from Robert Price, Apr 06 2019

A265807 Denominators of primes-only best approximates (POBAs) to 1/(golden ratio) = 1/tau; see Comments.

Original entry on oeis.org

2, 3, 5, 31, 37, 47, 157, 571, 911, 1021, 1487, 2351, 3571, 24709, 25463, 69247, 80803
Offset: 1

Views

Author

Clark Kimberling, Jan 02 2016

Keywords

Comments

Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q, and also, |x - p/q| < |x - p'/q| for every prime p' except p. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...). See A265759 for a guide to related sequences. Many terms of A265807 are also terms of A265800 (numerators of POBAs to tau).

Examples

			The POBAs to 1/tau start with 2/2, 2/3, 3/5, 19/31, 23/37, 29/47, 97/157, 353/571. For example, if p and q are primes and q > 157, then 97/157 is closer to 1/tau than p/q is.

Crossrefs

Cf. A000040, A265759, A265799, A265798, A265797, A265796, A265806.

Programs

  • Mathematica
    x = 1/GoldenRatio; z = 1000; 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, A265806/A265807 *)
Numerator[tL]   (* A265799 *)
Denominator[tL] (* A265798 *)
Numerator[tU]   (* A265797 *)
Denominator[tU] (* A265796 *)
Numerator[y]    (* A265806 *)
Denominator[y]  (* A265807 *)

Extensions

a(14)-a(17) from Robert Price, Apr 06 2019
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.